C++ 贪吃蛇自噬

这篇代码基于博主的“C++ 贪吃蛇基本算法”通过加入另一个二维数组maps以用来储存蛇身的来源，并通过简单的递归算法在蛇自噬时清除蛇的后半部分，并且修复了一些原来没发现的BUG。

#include <iostream>
#include <windows.h>
#include <cstring>
#include <time.h>
#include <conio.h>
#include <cstdio>
using namespace std;

char map[15][18];
char maps[15][18];

int error(char x,char y)
{
    if(x<y)
        if((y-x==3)||(y-x==4))
            return 1;
    if(x>y)
        if((x-y==3)||(x-y==4))
            return 1;
    if(x==y)
        return 1;
    return 0;
}
//纠正强行自噬 

int Pos(long x,long y)
{
    HANDLE direct=GetStdHandle(STD_OUTPUT_HANDLE);
    COORD pos={x,y};
    SetConsoleCursorPosition(direct,pos);
}
//改变光标位置

int Color(long clr)
{
    HANDLE direct=GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(direct,clr);
}
//改变输出颜色 

int Show(long judge)
{
    HANDLE direct=GetStdHandle(STD_OUTPUT_HANDLE);
    CONSOLE_CURSOR_INFO cci;
    GetConsoleCursorInfo(direct,&cci);
    cci.bVisible=judge;
    SetConsoleCursorInfo(direct,&cci);  
} 
//是否显示光标 

int Eat(long x,long y)
{
    switch(maps[x][y])
    {
        case 'w':map[x][y]=maps[x][y]=' ';Pos(20+y*2,3+x);cout<<"  ";Eat(x-1,y);break;
        case 's':map[x][y]=maps[x][y]=' ';Pos(20+y*2,3+x);cout<<"  ";Eat(x+1,y);break;
        case 'a':map[x][y]=maps[x][y]=' ';Pos(20+y*2,3+x);cout<<"  ";Eat(x,y-1);break;
        case 'd':map[x][y]=maps[x][y]=' ';Pos(20+y*2,3+x);cout<<"  ";Eat(x,y+1);break;
        case ' ':map[x][y]=' ';Pos(20+y*2,3+x);cout<<"  ";break;
    }
}

int main()
{

    char Key,Keys;
    long xh,yh,xt,yt,x0,y0;
    long start,timeover,level;
    long X,Y;

    memset(map,' ',sizeof(map));
    memset(maps,' ',sizeof(maps));
    for(long i=0;i<=14;i++)
    {
        if((i==0)||(i==14))
            for(long j=0;j<=17;j++)    
                map[i][j]=maps[i][j]='b';                        
        else
            map[i][0]=map[i][17]=maps[i][0]=maps[i][17]='b';
    }
    //地图初始化 
    xh=7,yh=9;
    xt=7,yt=8;
    map[xt][yt]='d';maps[xh][yh]='a';
    //蛇初始化 
    srand(time(0));
    do{
        x0=rand()%13+1;
        y0=rand()%16+1;
      }while(map[x0][y0]!=' '||(x0!=xh&&y0!=yh));
    map[x0][y0]='m';
    //出米 
    Pos(30,8);
    cout<<"请输入等级(1-8): ";
    cin>>level; 
    //输入等级
    Show(0);
    X=20;Y=3;
    Pos(X,Y);
    for(long i=0;i<=14;i++)
    {
        for(long j=0;j<=17;j++)
        {
            switch(map[i][j])
            {
                case 'b':
                    Color(0x02);
                    cout<<"■";
                    Color(0x0F);   
                    break;
                case 'w':
                case 'a':
                case 's':
                case 'd':
                    cout<<"■";
                    break;
                case 'm':
                    Color(0x03);
                    cout<<"■";
                    Color(0x0F);   
                    break;
                case ' ':
                    cout<<"  ";
                    break;
            }
        }
        Y++;
        Pos(X,Y);
    }
    X=20+yh*2;Y=3+xh;
    Pos(X,Y);    
    cout<<"■";
    //输出棋盘 
    Key='d';
    while(1)
    {
        timeover=1;
        start=clock();
        loop:
        while((timeover=(clock()-start<=(900-level*100)))&&!kbhit());
        {
            Keys=Key;
            if(timeover)
            {
                Key=getch();
                if(error(Key,Keys))
                {
                    Key=Keys;
                    goto loop;
                }
            }
            //纠正加速与强行自噬    
            switch(Key)
            {
                case 'W':case 'w':map[xh][yh]='w';xh--;break;
                case 'S':case 's':map[xh][yh]='s';xh++;break;
                case 'A':case 'a':map[xh][yh]='a';yh--;break;
                case 'D':case 'd':map[xh][yh]='d';yh++;break;
            }
            if(map[xh][yh]=='b')
            {
                Pos(30,18);
                cout<<"GameOver";
                getch();          
                return 0;
            }
            //游戏结束 
            if(map[xh][yh]=='w'||map[xh][yh]=='a'||map[xh][yh]=='s'||map[xh][yh]=='d')
            {
                switch(map[xh][yh])
                {
                    case 'w':xt=xh-1;yt=yh;maps[xt][yt]=' ';break;
                    case 's':xt=xh+1;yt=yh;maps[xt][yt]=' ';break;
                    case 'a':xt=xh;yt=yh-1;maps[xt][yt]=' ';break;
                    case 'd':xt=xh;yt=yh+1;maps[xt][yt]=' ';break;
                }
                Eat(xh,yh);
            }
            //判断自噬 
            switch(Key)
            {
                case 'W':case 'w':maps[xh][yh]='s';break;
                case 'S':case 's':maps[xh][yh]='w';break;
                case 'A':case 'a':maps[xh][yh]='d';break;
                case 'D':case 'd':maps[xh][yh]='a';break;
            }                              
            X=20+yh*2;Y=3+xh;
            Pos(X,Y);    
            cout<<"■";
            //移动蛇头 
            if(map[xh][yh]=='m')
            {
                srand(time(0));
                do{
                    x0=rand()%13+1;
                    y0=rand()%16+1;
                  }while(map[x0][y0]!=' '||(x0!=xh&&y0!=yh));
                map[x0][y0]='m';
                X=20+y0*2;Y=3+x0;
                Pos(X,Y);
                Color(0x03);
                cout<<"■";
                Color(0x0F);
                //出米 
            }                        
            else
            {
                X=20+yt*2;Y=3+xt;
                Pos(X,Y);    
                cout<<"  ";
                switch(map[xt][yt])
                {
                    case 'w':map[xt][yt]=' ';xt--;maps[xt][yt]=' ';break;
                    case 's':map[xt][yt]=' ';xt++;maps[xt][yt]=' ';break;
                    case 'a':map[xt][yt]=' ';yt--;maps[xt][yt]=' ';break;
                    case 'd':map[xt][yt]=' ';yt++;maps[xt][yt]=' ';break;
                }
            }                    
            //移动蛇尾 
        }
    }   
}