基于Ncurse图形库的贪吃蛇（C语言）

#include<curses.h>
#include<stdlib.h>
#include<stdio.h>

#define UP     1
#define DOWN  -1
#define LEFT   2
#define RIGHT -2

void initNcurses()
{
	initscr();
	keypad(stdscr,1);
	noecho();
}

struct Snake
{
	int hang;
	int lie;
	struct Snake*next;
};

struct Snake*head=NULL;
struct Snake*tail=NULL;
int key;
int dir;

struct Snake food;

void initFood()
{
	int x=rand()%40;
	int y=rand()%40;
	
	food.hang=x;
	food.lie=y;
}

int hasSnakeNode(int i,int j)
{
	struct Snake*p;
	p=head;
	
	while(p!=NULL)
	{
		if(i==p->hang&&j==p->lie)
		{
			return 1;
		}
		p=p->next;
	}
	return 0;
}

int hasFood(int i,int j)
{
	if(food.hang==i&&food.lie==j)
	{
		return 1;
	}
	return 0;
}

void gamePic()
{
	int hang;
	int lie;
	
	move(0,0);
	for(hang=0;hang<40;hang++)
	{
		if(hang==0)
		{
			for(lie=0;lie<40;lie++)
			{
				printw("--");
			}
			printw("\n");
		}
		
		if(hang>=0&&hang<=39)
		{
			for(lie=0;lie<=40;lie++)
			{
				if(lie==0||lie==40)
				{
					printw("|");
				}
				else if(hasSnakeNode(hang,lie))
				{
					printw("[]");
				}
				else if(hasFood(hang,lie))
				{
					printw("##");
				}
				else
				{
					printw("  ");
				}
			}
				printw("\n");
		}
		
		if(hang==39)
		{
			for(lie=0;lie<40;lie++)
			{
				printw("--");
			}
		printw("\n");    
		printw("By He Ziliang,key=%d,food.hang=%d,food.lie=%d",key,food.hang,food.lie);
		}
	}
}

void addNode()
{
	struct Snake*new=(struct Snake*)malloc(sizeof(struct Snake));
	
	switch(dir)
	{	
		case UP:
			new->hang=tail->hang-1;
			new->lie=tail->lie;
			new->next=NULL;
			break;
		case DOWN:
			new->hang=tail->hang+1;
                        new->lie=tail->lie;
                        new->next=NULL;
                        break;
		case LEFT:
                        new->hang=tail->hang;
                        new->lie=tail->lie-1;
                        new->next=NULL;
                        break;
		case RIGHT:
                        new->hang=tail->hang;
                        new->lie=tail->lie+1;
                        new->next=NULL;
                        break;
	}
	tail->next=new;
	tail=new;
}

void initSnake()
{	
	struct Snake*p=NULL;
	
	dir=RIGHT;
	
	while(head!=NULL)
	{
		p=head;
		head=head->next;
		free(p);
	}
	
	initFood();
	
	head=(struct Snake*)malloc(sizeof(struct Snake));
	
	head->hang=1;
	head->lie=1;
	head->next=NULL;
	
	tail=head;
	
	addNode();
}

void deleNode()
{
	head=head->next;
}

int ifSnakeDie()
{
	struct Snake*p;
	p=head;
	
	if(tail->hang<0||tail->lie==0||tail->hang==40||tail->lie==40)
        {
                return 1;
        }
	
	while(p->next!=NULL)
	{
		if(p->hang==tail->hang&&p->lie==tail->lie)
		{
			return 1;
		}
		p=p->next;
	}
	return 0;
}

void moveSnake()
{
	addNode();
	if(hasFood(tail->hang,tail->lie))
	{
		initFood();
	}
	else
	{
		deleNode();
	}
	
	if(ifSnakeDie())
	{
		initSnake();
	}
}

void refreshJieMian()
{
	while(1)
        {         
		moveSnake();
		gamePic();
		refresh();
		usleep(100000);
        }
}

void turn(int direction)
{
	if(abs(dir)!=abs(direction))
	{
		dir=direction;
	}
}

void changeDir()
{
	while(1)
	{
		key=getch();
		switch(key)
		{
			case KEY_DOWN:
			turn(DOWN);
			break;
			case KEY_UP:
			turn(UP);
                        break;
			case KEY_LEFT:
			turn(LEFT);
                        break;
			case KEY_RIGHT:
			turn(RIGHT);
                        break;
		}
	}
}

int main()
{	
	pthread_t t1;
	pthread_t t2;
	
	initNcurses();
	
	initSnake();
	
	gamePic();
	
	pthread_create(&t1,NULL,refreshJieMian,NULL);
	pthread_create(&t2,NULL,changeDir,NULL);
	
	while(1);
	
	getch();
	endwin();
	
	return 0;
}