C语言贪吃蛇实现链表学习

最新推荐文章于 2022-08-16 20:11:27 发布

AiSiBi77

最新推荐文章于 2022-08-16 20:11:27 发布

阅读量1.2k

点赞数

分类专栏： C语言文章标签： C语言贪吃蛇 C语言链表 C语言结构 C语言贪吃蛇

本文链接：https://blog.csdn.net/AiSiBi77/article/details/95357003

版权

以下代码片段就是整个源代码

代码主要是github上大佬写的,附上地址(https://github.com/mnisjk/snake.git)

我又在这基础上优化了点,释放漏释放的内存,禁止蛇反向运动

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <curses.h>
#include <sys/select.h>
#include <time.h>

#define SRC_WIDTH 70
#define SRC_HEIGHT 20

WINDOW *g_mainwin;
int g_oldcur, g_score = 0, g_width, g_height;

typedef struct
{
    int x;
    int y;
} pos;

pos fruit;

bool *spaces;


// queue stuff
struct s_node
{
    pos *position;
    struct s_node *prev;
    struct s_node *next;
} *front = NULL,*back =NULL;

typedef struct s_node node;

pos * peek(){
    return front == NULL ? NULL : front->position;
}

node * dequeue(){
    node *oldfront = front;
    front = front->next;
    return oldfront;
}

//queue a position at the back
void enqueue(pos position)
{
    pos *newpos = (pos *)malloc(sizeof(position));
    node *newnode = (node *)malloc(sizeof(node));

    newpos->x = position.x;
    newpos->y = position.y;
    newnode->next = newnode->prev = NULL;
    newnode->position = newpos;
    if(front == NULL && back ==NULL)
        front = back = newnode;
    else
    {
        back->next = newnode;
        newnode->prev