C++ 贪吃蛇二维

#include <iostream>
#include <conio.h>
#include <windows.h>
#include <time.h>

int g_Dir = ;
#define UP         0
#define DOWN  1
#define LEFT       2
#define RIGHT   3

struct FOOD
{
    int X = ;
    int Y = ;
    bool State = ;
}Food;

//方向控制
void SnekeMove()
{
    if (::GetAsyncKeyState(VK_UP) & )
        g_Dir = ;
    if (::GetAsyncKeyState(VK_DOWN) & )
        g_Dir = ;
    if (::GetAsyncKeyState(VK_LEFT) & )
        g_Dir = ;
    if (::GetAsyncKeyState(VK_RIGHT) & )
        g_Dir = ;
}

//主函数
int main()
{
    srand((unsigned int)time(NULL));
    int W = ;
    int H = ;
    int Len = ;
    int Map[][] = {  };
    int Snake[][] = {  };
    //Snake[0] = 2;//为蛇头

    for (int i = ; i < Len; i++)
    {
        Snake[i][] = Len - i - ;
    }
    Food.X = W / ;
    Food.Y = H / ;
    Map[Food.Y][Food.X] = ;

    const char *SNAKE[] = { "  ", "■" ,"★"};
    while (true)
    {
        system("cls");
        int x = ;
        int y = ;
        for (int i = ; i < Len; i++)
        {
            // 2 1 0
            // 1 1 1

            // 3 2 1
            // 0 1 1 1
            //这里需要注意
            x = Snake[i][];
            y = Snake[i][];
            //这里取决于对二维数组的理解
            //虽然Y始终为0
            //Map[y] 为首地址
            //经过推理得到这几种写法
            //*(Map[y] + x) = 1;
            //Map[y][x] = 1;
            *(Map[] + x) = ;
            //Map[0][x] = 1;
        }
        for (int i = ; i < H; i++)
        {
            for (int j = ; j < W; j++)
            {
                std::cout << SNAKE[Map[i][j]];
            }
            std::cout << std::endl;
        }
        memset(Map, , sizeof(Map));
        SnekeMove();
        for (int i = Len; i > ; i--)
        {
            Snake[i][] = Snake[i - ][];
        }

        if (g_Dir == UP)
        {
            Snake[][] -= W;
        }
        if (g_Dir == DOWN)
        {
            Snake[][] += W;
        }
        if (g_Dir == LEFT)
        {
            Snake[][]--;
        }
        if (g_Dir == RIGHT)
        {
            Snake[][]++;
        }

        Sleep();
    }

    //https://www.bilibili.com/video/av29007126/?spm_id_from=333.788.videocard.1
    system("pause");
    return ;
}