基于Linux下的ncurses图形库编写的贪吃蛇小游戏

项目要求

通过使用链表的相关知识，以及调用ncurses的部分函数使得贪吃蛇具备以下功能：
控制贪吃蛇的方向
随机生成果实并使吃到果实的蛇身子变长
撞到墙或自己撞到自己则游戏重新开始

项目实现源码

#include <curses.h>
#include <stdlib.h>
struct Snake
{
       int hang;
       int lie;
       struct Snake *next;
};

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



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

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

void addnode()
{
     struct Snake *new = (struct Snake *)malloc(sizeof(struct Snake));

     new->next = NULL;

     switch(dir){
     case UP:
            new->hang = tail->hang-1;
            new->lie = tail->lie;
            break;
     case DOWN:
            new->hang = tail->hang+1;
            new->lie = tail->lie;
            break;
     case LEFT:
            new->hang = tail->hang;
            new->lie = tail->lie-1;
            break;
     case RIGHT:
            new->hang = tail->hang;
            new->lie = tail->lie+1;
            break;
     }
     tail->next = new;
     tail = new;
}


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

void initNcurse()
{
   
    initscr();
    keypad(stdscr,1);
}

int hasSnakenode(int i, int j)
{
    struct Snake *p;
    p = head;
    while(p != NULL){
    if(p->hang == i && p->lie == j)
    {
       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<20;hang++){
     if(hang == 0){
        for(lie=0;lie<20;lie++){
           printw("--");
           }
           printw("\n");
           for(lie=0;lie<20;lie++){
              if(lie == 0 || lie == 20){
                 printw("|");
                 }
                 else{
                 printw("  ");
                 }
              }
                 printw("\n");
        }
       if(hang>=0 || hang<=19){
         for(lie=0;lie<=20;lie++){
               if(lie == 0||lie == 20){
                 printw("|");
               }
               else if(hasSnakenode(hang,lie)){
                   printw("[]");
                   }else if(hasFood(hang,lie)){
                       printw("##");
                       }
               else{
                  printw("  ");
               }
         }
         printw("\n");
       }
       if(hang == 19){
          for(lie=0;lie<20;lie++){
          printw("--");
          }
          printw("\n");
          printw("byxiangyunfan%d\n",key);
          
       }
     }
}

void deletenode(){
    struct Snake *p;
    p = head; 
    head = head->next;
    free(p);
}

int ifSnakeDie()
{
     struct Snake *p;
     p = head;
    
     if(tail->hang < 0 || tail->lie == 0 || tail->hang == 20 || tail->lie ==20)
     {
       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)){
     intFood();
     }else{  
     deletenode();
     }
     if(ifSnakeDie()){
     initSnake();
     }
}


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


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;

    initSnake();   
    initNcurse();

    gamePic();
   
    pthread_create(&t1, NULL, refreshJieMian, NULL);    
    pthread_create(&t2, NULL, changeDir, NULL);    
    while(1);
    getch();
    endwin();   
    return 0;
}