采用了双向链表结点来模拟蛇身结点;

  通过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语言双向链表实现的更多相关文章

  1. 基于EasyX库的贪吃蛇游戏——C语言实现

    接触编程有段时间了,一直想学习怎么去写个游戏来练练手.在看了B站上的教学终于可以自己试试怎么实现贪吃蛇这个游戏了.好了,废话不多说,我们来看看如何用EasyX库来实现贪吃蛇. 一.准备 工具vc++6 ...

  2. 贪吃蛇游戏C语言源代码学习

    源代码下载地址为:www.clang.cc 阅读学习了源代码,并做了简单的注释和修改,里面只用了链表数据结构,非常适合C语言入门者学习阅读. 程序可在VS2013下编译运行. #include< ...

  3. 【C语言项目】贪吃蛇游戏(上)

    目录 00. 目录 01. 开发背景 02. 功能介绍 03. 欢迎界面设计 3.1 常用终端控制函数 3.2 设置文本颜色函数 3.3 设置光标位置函数 3.4 绘制字符画(蛇) 3.5 欢迎界面函 ...

  4. 贪吃蛇游戏(printf输出C语言版本)

    这一次我们应用printf输出实现一个经典的小游戏—贪吃蛇,主要难点是小蛇数据如何存储.如何实现转弯的效果.吃到食物后如何增加长度. 1 构造小蛇 首先,在画面中显示一条静止的小蛇.二维数组canva ...

  5. 使用Love2D引擎开发贪吃蛇游戏

    今天来介绍博主近期捣腾的一个小游戏[贪吃蛇],贪吃蛇这个游戏相信大家都不会感到陌生吧.今天博主将通过Love2D这款游戏引擎来为大家实现一个简单的贪吃蛇游戏,在本篇文章其中我们将会涉及到贪吃蛇的基本算 ...

  6. Android快乐贪吃蛇游戏实战项目开发教程-01项目概述与目录

    一.项目简介 贪吃蛇是一个很经典的游戏,也很适合用来学习.本教程将和大家一起做一个Android版的贪吃蛇游戏. 我已经将做好的案例上传到了应用宝,无病毒.无广告,大家可以放心下载下来把玩一下.应用宝 ...

  7. 用C++实现的贪吃蛇游戏

    我是一个C++初学者,控制台实现了一个贪吃蛇游戏. 代码如下: //"贪吃蛇游戏"V1.0 //李国良于2016年12月29日编写完成 #include <iostream& ...

  8. WebGL实现HTML5的3D贪吃蛇游戏

    js1k.com收集了小于1k的javascript小例子,里面有很多很炫很酷的游戏和特效,今年规则又增加了新花样,传统的classic类型基础上又增加了WebGL类型,以及允许增加到2K的++类型, ...

  9. 100行JS实现HTML5的3D贪吃蛇游戏

    js1k.com收集了小于1k的javascript小例子,里面有很多很炫很酷的游戏和特效,今年规则又增加了新花样,传统的classic类型基础上又增加了WebGL类型,以及允许增加到2K的++类型, ...

随机推荐

  1. FreeHttp (a fiddler add in to temper the http)

    introduction FreeHttp is a Fiddler plugin. With FreeHttp you can modify the request or response mess ...

  2. xcode10下,Build Phases下没有Embed Frameworks

    升级xcode10后发现,Build Phases下,找不到Embed Frameworks了,最后发现在General下,有一项“Embedded Binaries",可以在这里添加Fra ...

  3. JSP中常用的的EL表达式的汇总

    Jsp基础知识 jsp的组成 html静态页面(css.javascript) java代码 <% %> (_jspService方法中) 内置对象 out request 表达式 < ...

  4. Scrapy:配置日志

    Scrapy logger 在每个spider实例中提供了一个可以访问和使用的实例,方法如下: import scrapy class MySpider(scrapy.Spider): name = ...

  5. vue 修改数据界面没有及时更新nextTick

    使用场景:有些时候,我们使用vue修改了一些数据,但是页面上的DOM还没有更新,这个时候我们就需要使用到nextTick. vm.$nextTick( [callback] ) 说明: 将回调延迟到下 ...

  6. gitlab搭建和使用

    原文地址:https://blog.csdn.net/zhushuai662/article/details/79581377 大家常听说Git.Github.Gitlab,很多人对着三个词很懵逼,分 ...

  7. Object.clone()方法与对象的深浅拷贝

    转载:[https://www.cnblogs.com/nickhan/p/8569329.html] 引言 在某些场景中,我们需要获取到一个对象的拷贝用于某些处理.这时候就可以用到Java中的Obj ...

  8. 【MySQL 读书笔记】RR(REPEATABLE-READ)事务隔离详解

    这篇我觉得有点难度,我会更慢的更详细的分析一些 case . MySQL 的默认事务隔离级别和其他几个主流数据库隔离级别不同,他的事务隔离级别是 RR(REPEATABLE-READ) 其他的主流数据 ...

  9. [算法]浅谈求n范围以内的质数(素数)

    汗颜,数学符号表达今天才学会呀-_-# 下面是百度百科对质数的定义 质数(prime number)又称素数,有无限个. 质数定义为在大于1的自然数中,除了1和它本身以外不再有其他因数. 求质数的方法 ...

  10. SpringBoot之常用注解

    在spring boot中,摒弃了spring以往项目中大量繁琐的配置,遵循约定大于配置的原则,通过自身默认配置,极大的降低了项目搭建的复杂度.同样在spring boot中,大量注解的使用,使得代码 ...