linux贪吃蛇c程序,贪吃蛇 linux 程序

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

周末闲来谢谢代码打发时间

以下代码

---------------------------------------------------------------

/***********************贪吃蛇 linux***************/

/**************************************************/

/***************create by C_9999 ******************/

/************contact Info: 847402588@qq.com*******/

/**************************************************/

#include"common.h"

#include

#include

#include

#include

#include

enum{

UP,

DOWM,

LEFT,

RIGHT

};

struct st_snake

{

u2 u2_line;

u2 u2_cols;

u1 u1_length;

struct st_snake* st_snakeNext;

struct st_snake* st_snakePrev;

};

/***********static varaible********************/

struct st_snake* sst_snakeHead;

struct itimerval st_tmVal;

u2 static su2_foodLine;

u2 static su2_foodCols;

u1 static su1_moveStatus;

/***********static function********************/

void fs_init();

void fs_close_scr();

void fs_show_food();

void fs_snake_init();

void fs_snake_automove(s4 ts4_n); /*** called by signal*****/

void fs_snake_moveLeft();

void fs_snake_moveRight();

void fs_snake_moveUp();

void fs_snake_moveDowm();

void fs_snake_add();

u1 fs_judge();

/**functioan**/

/**********main functioan***************/

int main()

{

u1 u1_ch;

srand((unsigned)time(NULL));

fs_init();

curs_set(0);

fs_snake_init();

fs_show_food();

refresh();

signal(SIGALRM,fs_snake_automove);

/**enter the moving direction**/

while(1)

{

u1_ch = getchar();

switch(u1_ch)

{

case 'w':

if(su1_moveStatus != DOWM)

{

su1_moveStatus = UP;

}

break;

case 'd':

if(su1_moveStatus != LEFT)

{

su1_moveStatus = RIGHT;

}

break;

case 'a':

if(su1_moveStatus != RIGHT)

{

su1_moveStatus = LEFT;

}

break;

case 's':

if(su1_moveStatus != UP)

{

su1_moveStatus = DOWM;

}

break;

default:

break;

}

}

fs_close_scr();

return 0;

}

void fs_init()

{

initscr();

memset(&st_tmVal,0,sizeof(st_tmVal));

st_tmVal.it_value.tv_sec = 0;

st_tmVal.it_value.tv_usec = 250000;

st_tmVal.it_interval.tv_sec = 0;

st_tmVal.it_interval.tv_usec = 250000;

setitimer (ITIMER_REAL, &st_tmVal, 0);

/****** init the food ********/

su2_foodLine = random()%LINES;

su2_foodCols = random()%COLS;

}

void fs_show_food()

{

mvaddch(su2_foodLine,su2_foodCols,'*');

refresh();

return;

}

void fs_snake_init()

{

u1 tu1_i;

struct st_snake* tpt_st_snake;

struct st_snake* tpt_st_snakeT;

su1_moveStatus = LEFT;

sst_snakeHead = (struct st_snake*)malloc(1);

sst_snakeHead->st_snakeNext = NULL;

sst_snakeHead->st_snakePrev = NULL;

sst_snakeHead->u1_length = 3;

sst_snakeHead->u2_line = LINES/2;

sst_snakeHead->u2_cols = COLS/2;

refresh();

mvaddch(sst_snakeHead->u2_line,sst_snakeHead->u2_cols,'@');

refresh();

tpt_st_snakeT = sst_snakeHead;

for(tu1_i=0; tu1_iu1_length-1 ;tu1_i++)

{

tpt_st_snake = (struct st_snake*)malloc(1);

tpt_st_snake->u2_line = tpt_st_snakeT->u2_line;

tpt_st_snake->u2_cols = (tpt_st_snakeT->u2_cols) + 1;

tpt_st_snake->st_snakeNext = NULL;

tpt_st_snake->st_snakePrev = tpt_st_snakeT;

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols,'*');

refresh();

tpt_st_snakeT->st_snakeNext = tpt_st_snake;

tpt_st_snakeT = tpt_st_snake;

}

return;

}

void fs_snake_automove(s4 ts4_n)

{

u1 tu1_move_status;

tu1_move_status = su1_moveStatus;

clear();

fs_show_food();

switch(tu1_move_status)

{

case UP:

fs_snake_moveUp();

break;

case DOWM:

fs_snake_moveDowm();

break;

case LEFT:

fs_snake_moveLeft();

break;

case RIGHT:

fs_snake_moveRight();

break;

default:

break;

}

if(fs_judge())

{

fs_close_scr();

exit(0);

}

return;

}

void fs_snake_moveLeft()

{

u1 tu1_i;

u2 tu2_line;

u2 tu2_cols;

struct st_snake* tpt_st_snake;

tpt_st_snake = sst_snakeHead;

/***draw the snake head***/

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols-1,'@');

/***find the snake tail***/

while(tpt_st_snake->st_snakeNext != NULL)

{

tpt_st_snake = tpt_st_snake->st_snakeNext;

}

/**Node => prev Node**/

while(tpt_st_snake->st_snakePrev !=NULL)

{

tpt_st_snake->u2_line = (tpt_st_snake->st_snakePrev)->u2_line;

tpt_st_snake->u2_cols = (tpt_st_snake->st_snakePrev)->u2_cols;

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols,'*');

tpt_st_snake = tpt_st_snake->st_snakePrev;

}

sst_snakeHead->u2_cols = sst_snakeHead->u2_cols - 1;

refresh();

return;

}

void fs_snake_moveUp()

{

u1 tu1_i;

u2 tu2_line;

u2 tu2_cols;

struct st_snake* tpt_st_snake;

tpt_st_snake = sst_snakeHead;

/***draw the snake head***/

mvaddch(tpt_st_snake->u2_line-1,tpt_st_snake->u2_cols,'@');

/***find the snake tail***/

while(tpt_st_snake->st_snakeNext != NULL)

{

tpt_st_snake = tpt_st_snake->st_snakeNext;

}

/*Node => prev Node*/

while(tpt_st_snake->st_snakePrev !=NULL)

{

tpt_st_snake->u2_line = (tpt_st_snake->st_snakePrev)->u2_line;

tpt_st_snake->u2_cols = (tpt_st_snake->st_snakePrev)->u2_cols;

refresh();

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols,'*');

tpt_st_snake = tpt_st_snake->st_snakePrev;

}

sst_snakeHead->u2_line = sst_snakeHead->u2_line - 1;

refresh();

return;

}

void fs_snake_moveRight()

{

u1 tu1_i;

u2 tu2_line;

u2 tu2_cols;

struct st_snake* tpt_st_snake;

tpt_st_snake = sst_snakeHead;

/*draw the snake head*/

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols+1,'@');

/*find the snake tail*/

while(tpt_st_snake->st_snakeNext != NULL)

{

tpt_st_snake = tpt_st_snake->st_snakeNext;

}

/*Node => prev Node*/

while(tpt_st_snake->st_snakePrev !=NULL)

{

tpt_st_snake->u2_line = (tpt_st_snake->st_snakePrev)->u2_line;

tpt_st_snake->u2_cols = (tpt_st_snake->st_snakePrev)->u2_cols;

refresh();

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols,'*');

tpt_st_snake = tpt_st_snake->st_snakePrev;

}

sst_snakeHead->u2_cols += 1;

refresh();

return;

}

void fs_snake_moveDowm()

{

u1 tu1_i;

u2 tu2_line;

u2 tu2_cols;

struct st_snake* tpt_st_snake;

tpt_st_snake = sst_snakeHead;

/*draw the snake head*/

mvaddch(tpt_st_snake->u2_line+1,tpt_st_snake->u2_cols,'@');

/*find the snake tail*/

while(tpt_st_snake->st_snakeNext != NULL)

{

tpt_st_snake = tpt_st_snake->st_snakeNext;

}

/*Node => prev Node*/

while(tpt_st_snake->st_snakePrev !=NULL)

{

tpt_st_snake->u2_line = (tpt_st_snake->st_snakePrev)->u2_line;

tpt_st_snake->u2_cols = (tpt_st_snake->st_snakePrev)->u2_cols;

refresh();

mvaddch(tpt_st_snake->u2_line,tpt_st_snake->u2_cols,'*');

tpt_st_snake = tpt_st_snake->st_snakePrev;

}

sst_snakeHead->u2_line = sst_snakeHead->u2_line +1;

refresh();

return;

}

void fs_snake_add()

{

struct st_snake* tpt_st_snakeNew;

struct st_snake* tpt_st_snake;

tpt_st_snakeNew = (struct st_snake*) malloc(1);

tpt_st_snake = sst_snakeHead;

while(tpt_st_snake->st_snakeNext != NULL)

{

tpt_st_snake = tpt_st_snake->st_snakeNext;

}

tpt_st_snakeNew->st_snakePrev = tpt_st_snake;

tpt_st_snakeNew->st_snakeNext = NULL;

tpt_st_snake->st_snakeNext = tpt_st_snakeNew;

/*reput the food*/

su2_foodCols = random()%COLS;

su2_foodLine = random()%LINES;

return;

}

void fs_close_scr()

{

struct st_snake* tpt_st_snake;

struct st_snake* tpt_st_snakeT;

tpt_st_snake = sst_snakeHead;

while(tpt_st_snake->st_snakeNext !=NULL)

{

tpt_st_snakeT = tpt_st_snake->st_snakeNext;

free(tpt_st_snake);

tpt_st_snake = tpt_st_snakeT;

}

endwin();

return;

}

u1 fs_judge()

{

u1 u1_rtnVal;

struct st_snake* tpt_st_snake;

tpt_st_snake = sst_snakeHead;

u1_rtnVal = 0;

/**if touch the edge of window gameovere**/

if( (sst_snakeHead->u2_cols == 0) ||

(sst_snakeHead->u2_line == 0) ||

(sst_snakeHead->u2_cols == COLS) ||

(sst_snakeHead->u2_line == LINES) )

{

u1_rtnVal = 1;

}

/**if snake eat itself**/

tpt_st_snake = tpt_st_snake->st_snakeNext;

while(tpt_st_snake->st_snakeNext != NULL)

{

if( (sst_snakeHead->u2_cols == tpt_st_snake->u2_cols) &&

(sst_snakeHead->u2_line == tpt_st_snake->u2_line) )

{

u1_rtnVal = 1;

}

tpt_st_snake = tpt_st_snake->st_snakeNext;

}

/**If snake_head position == food**/

if( (sst_snakeHead->u2_cols == su2_foodCols) &&

(sst_snakeHead->u2_line == su2_foodLine) )

{

fs_snake_add();

beep();

}

return u1_rtnVal;

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
【优质项目推荐】 1、项目代码均经过严格本地测试,运行OK,确保功能稳定后才上传平台。可放心下载并立即投入使用,若遇到任何使用问题,随时欢迎私信反馈与沟通,博主会第一时间回复。 2、项目适用于计算机相关专业(如计科、信息安全、数据科学、人工智能、通信、物联网、自动化、电子信息等)的在校学生、专业教师,或企业员工,小白入门等都适用。 3、该项目不仅具有很高的学习借鉴价值,对于初学者来说,也是入门进阶的绝佳选择;当然也可以直接用于 毕设、课设、期末大作业或项目初期立项演示等。 3、开放创新:如果您有一定基础,且热爱探索钻研,可以在此代码基础上二次开发,进行修改、扩展,创造出属于自己的独特应用。 欢迎下载使用优质资源!欢迎借鉴使用,并欢迎学习交流,共同探索编程的无穷魅力! 基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip 基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip 基于业务逻辑生成特征变量python实现源码+数据集+超详细注释.zip

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值