贪吃蛇游戏——C语言双向链表实现
采用了双向链表结点来模拟蛇身结点;
通过C语言光标控制函数来打印地图、蛇身和食物;
/**************************
***************************
贪吃蛇游戏
C语言数据结构
作者:Dew
时间:2019年3月23日
版本:1.0
***************************
**************************/ #include <stdio.h>
#include <stdlib.h>
#include <Windows.h>
#include <conio.h> #define N 30
#define TRUE 1
#define FALSE 0
#define TIME 300 #define LEFT 37
#define UP 38
#define RIGHT 39
#define DOWN 40 void initMap();
void showGame();
void initSnake();
void control(int key);
void updateSnake(int next_head_x, int next_head_y);
void gotoxy(int x, int y); //光标控制
void gameRun();
void moveUp();
void moveDown();
void moveLeft();
void moveRight();
void createFood();
void addSnakeNode(int cur_tail_x, int cur_tail_y);
void crashTest(int head_x, int head_y); struct snakeNode {
int pos_x;
int pos_y;
snakeNode* pre;
snakeNode* next;
}; struct foodNode {
int pos_x;
int pos_y;
}; int map[N][N];
int keyPress;
int key; int next_head_x, next_head_y;
int cur_tail_x, cur_tail_y; snakeNode* snake_head = (snakeNode *)malloc(sizeof(snakeNode));
snakeNode* snake_tail = (snakeNode *)malloc(sizeof(snakeNode)); foodNode* food = (foodNode *)malloc(sizeof(foodNode)); int main()
{
initSnake(); initMap(); gameRun(); return 0;
} void initMap()
{
int i, j;
for(i = 0; i < N; i++)
for (j = 0; j < N; j++)
{
if (i == 0 || i == N - 1)
map[i][j] = 1;
else if (j == 0 || j == N - 1)
map[i][j] = 1;
else
map[i][j] = 0;
}
} void showGame()
{
int i, j;
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
if (map[i][j] == 1) {
gotoxy(j*2, i);
printf("□");
}
else if (map[i][j] == 0) {
gotoxy(j*2, i);
printf(" ");
}
}
printf("\n");
}
gotoxy(snake_head->pos_y * 2, snake_head->pos_x);
printf("●");
gotoxy(snake_tail->pos_y * 2, snake_tail->pos_x);
printf("●");
gotoxy(food->pos_y * 2, food->pos_x);
printf("◇");
} void initSnake()
{
snake_head->pos_x = 15;
snake_head->pos_y = 15;
snake_head->pre = NULL;
snake_head->next = snake_tail; snake_tail->pre = snake_head;
snake_tail->pos_x = snake_tail->pre->pos_x + 1;
snake_tail->pos_y = snake_tail->pre->pos_y;
snake_tail->next = NULL; food->pos_x = rand() % 28 + 1;
food->pos_y = rand() % 28 + 1;
} void control(int direction)
{
if (direction == UP)
{
moveUp();
}
else if (direction == DOWN)
{
moveDown();
}
else if (direction == LEFT)
{
moveLeft();
}
else if (direction == RIGHT)
{
moveRight();
} } void updateSnake(int next_head_x, int next_head_y)
{
snakeNode* p = snake_tail;
while (p != snake_head)
{
p->pos_x = p->pre->pos_x;
p->pos_y = p->pre->pos_y;
p = p->pre;
}
p->pos_x = next_head_x;
p->pos_y = next_head_y;
} void gotoxy(int x, int y)
{
COORD pos;
HANDLE hOutput;
pos.X = x;
pos.Y = y;
hOutput = GetStdHandle(STD_OUTPUT_HANDLE);
SetConsoleCursorPosition(hOutput, pos);
} void gameRun()
{
showGame(); control(UP); while (TRUE)
{
if (GetAsyncKeyState(VK_RIGHT))
{
control(RIGHT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_LEFT))
{
control(LEFT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_UP))
{
control(UP);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_DOWN))
{
control(DOWN);
Sleep(TIME);
}
}
} void moveUp()
{
while (TRUE)
{
next_head_x = snake_head->pos_x - 1;
next_head_y = snake_head->pos_y;
cur_tail_x = snake_tail->pos_x;
cur_tail_y = snake_tail->pos_y;
updateSnake(next_head_x, next_head_y);
gotoxy(next_head_y * 2, next_head_x);
printf("●");
crashTest(next_head_x, next_head_y);
if (next_head_x == food->pos_x && next_head_y == food->pos_y)
{
addSnakeNode(cur_tail_x, cur_tail_y);
createFood();
}
else
{
gotoxy(cur_tail_y * 2, cur_tail_x);
printf(" ");
} Sleep(TIME); if (GetAsyncKeyState(VK_RIGHT))
{
control(RIGHT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_LEFT))
{
control(LEFT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_UP))
{
control(UP);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_DOWN))
{
continue;
} }
} void moveDown()
{
while (TRUE)
{
next_head_x = snake_head->pos_x + 1;
next_head_y = snake_head->pos_y;
cur_tail_x = snake_tail->pos_x;
cur_tail_y = snake_tail->pos_y;
updateSnake(next_head_x, next_head_y);
gotoxy(next_head_y * 2, next_head_x);
printf("●");
crashTest(next_head_x, next_head_y);
if (next_head_x == food->pos_x && next_head_y == food->pos_y)
{
addSnakeNode(cur_tail_x, cur_tail_y);
createFood();
}
else
{
gotoxy(cur_tail_y * 2, cur_tail_x);
printf(" ");
} Sleep(TIME);
if (GetAsyncKeyState(VK_RIGHT))
{
control(RIGHT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_LEFT))
{
control(LEFT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_UP))
{
continue;
}
else if (GetAsyncKeyState(VK_DOWN))
{
control(DOWN);
Sleep(TIME);
} }
} void moveLeft()
{
while (TRUE)
{
next_head_x = snake_head->pos_x;
next_head_y = snake_head->pos_y - 1;
cur_tail_x = snake_tail->pos_x;
cur_tail_y = snake_tail->pos_y;
updateSnake(next_head_x, next_head_y);
gotoxy(next_head_y * 2, next_head_x);
printf("●");
crashTest(next_head_x, next_head_y);
if (next_head_x == food->pos_x && next_head_y == food->pos_y)
{
addSnakeNode(cur_tail_x, cur_tail_y);
createFood();
}
else
{
gotoxy(cur_tail_y * 2, cur_tail_x);
printf(" ");
} Sleep(TIME);
if (GetAsyncKeyState(VK_RIGHT))
{
continue;
}
else if (GetAsyncKeyState(VK_LEFT))
{
control(LEFT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_UP))
{
control(UP);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_DOWN))
{
control(DOWN);
Sleep(TIME);
} }
} void moveRight()
{
while (TRUE)
{
next_head_x = snake_head->pos_x;
next_head_y = snake_head->pos_y + 1;
cur_tail_x = snake_tail->pos_x;
cur_tail_y = snake_tail->pos_y;
updateSnake(next_head_x, next_head_y);
gotoxy(next_head_y * 2, next_head_x);
printf("●");
crashTest(next_head_x, next_head_y);
if (next_head_x == food->pos_x && next_head_y == food->pos_y)
{
addSnakeNode(cur_tail_x, cur_tail_y);
createFood();
}
else
{
gotoxy(cur_tail_y * 2, cur_tail_x);
printf(" ");
} Sleep(TIME);
if (GetAsyncKeyState(VK_RIGHT))
{
control(RIGHT);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_LEFT))
{
continue;
}
else if (GetAsyncKeyState(VK_UP))
{
control(UP);
Sleep(TIME);
}
else if (GetAsyncKeyState(VK_DOWN))
{
control(DOWN);
Sleep(TIME);
} }
} void createFood()
{
food->pos_x = rand() % 28 + 1;
food->pos_y = rand() % 28 + 1;
gotoxy(food->pos_y * 2, food->pos_x);
printf("◇");
} void addSnakeNode(int cur_tail_x, int cur_tail_y)
{
snakeNode* tempNode = (snakeNode *)malloc(sizeof(snakeNode));
tempNode->pos_x = cur_tail_x;
tempNode->pos_y = cur_tail_y;
tempNode->next = NULL;
snake_tail->next = tempNode;
tempNode->pre = snake_tail;
snake_tail = tempNode;
} void crashTest(int head_x, int head_y)
{
snakeNode* p = snake_head->next;
while (p != NULL)
{
if (p->pos_x == head_x && p->pos_y == head_y)
{
gotoxy(32 * 2, 15);
printf("...发生撞击!......游戏结束...");
getchar();
}
if (p->pos_x == 1 || p->pos_x == N - 2 || p->pos_y == 1 || p->pos_y == N - 2)
{
gotoxy(32 * 2, 15);
printf("...发生撞击!......游戏结束...");
getchar();
}
p = p->next;
}
}
贪吃蛇游戏——C语言双向链表实现的更多相关文章
- 基于EasyX库的贪吃蛇游戏——C语言实现
接触编程有段时间了,一直想学习怎么去写个游戏来练练手.在看了B站上的教学终于可以自己试试怎么实现贪吃蛇这个游戏了.好了,废话不多说,我们来看看如何用EasyX库来实现贪吃蛇. 一.准备 工具vc++6 ...
- 贪吃蛇游戏C语言源代码学习
源代码下载地址为:www.clang.cc 阅读学习了源代码,并做了简单的注释和修改,里面只用了链表数据结构,非常适合C语言入门者学习阅读. 程序可在VS2013下编译运行. #include< ...
- 【C语言项目】贪吃蛇游戏(上)
目录 00. 目录 01. 开发背景 02. 功能介绍 03. 欢迎界面设计 3.1 常用终端控制函数 3.2 设置文本颜色函数 3.3 设置光标位置函数 3.4 绘制字符画(蛇) 3.5 欢迎界面函 ...
- 贪吃蛇游戏(printf输出C语言版本)
这一次我们应用printf输出实现一个经典的小游戏—贪吃蛇,主要难点是小蛇数据如何存储.如何实现转弯的效果.吃到食物后如何增加长度. 1 构造小蛇 首先,在画面中显示一条静止的小蛇.二维数组canva ...
- 使用Love2D引擎开发贪吃蛇游戏
今天来介绍博主近期捣腾的一个小游戏[贪吃蛇],贪吃蛇这个游戏相信大家都不会感到陌生吧.今天博主将通过Love2D这款游戏引擎来为大家实现一个简单的贪吃蛇游戏,在本篇文章其中我们将会涉及到贪吃蛇的基本算 ...
- Android快乐贪吃蛇游戏实战项目开发教程-01项目概述与目录
一.项目简介 贪吃蛇是一个很经典的游戏,也很适合用来学习.本教程将和大家一起做一个Android版的贪吃蛇游戏. 我已经将做好的案例上传到了应用宝,无病毒.无广告,大家可以放心下载下来把玩一下.应用宝 ...
- 用C++实现的贪吃蛇游戏
我是一个C++初学者,控制台实现了一个贪吃蛇游戏. 代码如下: //"贪吃蛇游戏"V1.0 //李国良于2016年12月29日编写完成 #include <iostream& ...
- WebGL实现HTML5的3D贪吃蛇游戏
js1k.com收集了小于1k的javascript小例子,里面有很多很炫很酷的游戏和特效,今年规则又增加了新花样,传统的classic类型基础上又增加了WebGL类型,以及允许增加到2K的++类型, ...
- 100行JS实现HTML5的3D贪吃蛇游戏
js1k.com收集了小于1k的javascript小例子,里面有很多很炫很酷的游戏和特效,今年规则又增加了新花样,传统的classic类型基础上又增加了WebGL类型,以及允许增加到2K的++类型, ...
随机推荐
- 【转】手把手教你读取Android版微信和手Q的聊天记录(仅作技术研究学习)
1.引言 特别说明:本文内容仅用于即时通讯技术研究和学习之用,请勿用于非法用途.如本文内容有不妥之处,请联系JackJiang进行处理! 我司有关部门为了获取黑产群的动态,有同事潜伏在大量的黑产群 ...
- resnet18全连接层改成卷积层
想要尝试一下将resnet18最后一层的全连接层改成卷积层看会不会对网络效果和网络大小有什么影响 1.首先先对train.py中的更改是: train.py代码可见:pytorch实现性别检测 # m ...
- Python学习案例之视频人脸检测识别
前言 上一篇博文与大家分享了简单的图片人脸识别技术,其实在实际应用中,很多是通过视频流的方式进行识别,比如人脸识别通道门禁考勤系统.人脸动态跟踪识别系统等等. 案例 这里我们还是使用 opencv 中 ...
- 前序遍历构造已知二叉树(Java)
public BiNode createBiTree() { Scanner input = new Scanner(System.in); int k = input.nextInt(); if(k ...
- Python----多项式回归
多项式线性回归 1.多项式线性方程: 与多元线性回归相比,它只有一个自变量,但有不同次方数. 2.举例: import numpy as np import matplotlib.pyplot as ...
- js 前端常用排序算法总结
(冒泡排序.快排顺序.选择排序.插入排序.归并排序) 下面是前端比较常用的五个算法demo: 冒泡算法:比较两个相邻的数值,if第一个>第二个,交换他们的位置元素项向上移动至正确的顺序. fun ...
- mysql5.6.x 字符集修改
1 安装好mysql5.6.x 之后,修改字符集配置为utf8才能支持中文,因为默认为latin1 查看mysql字符集命令: SHOW VARIABLES LIKE 'char%' 2 修改配置文件 ...
- centos7之zabbix的监控H3C ER3200G2流量
1.首先在服务器端安装snmp工具 yum -y install net-snmp-utils snmp-libs snmp-devel snmp 启动snmpd服务 systemctl start ...
- call, apply 和 bind 方法
我们知道,每个函数在调用的时候会产生一个执行上下文环境,而这个执行上下文环境中包含了诸如 this 等等信息.即当我们调用函数的时候,内部的 this 已经明确地隐式绑定到了某一个对象上.如果我们希望 ...
- Jetson TX1 compile pytorch issues
1. c++: internal compiler error: Killed (program cc1plus) reason: memory out, need swapfile 2. NCCL ...