贪吃蛇（C）

　　

缺点：

　　代码复用性不太高，重复或相似代码太多

　

学完数据结构

　　考虑使用 链表做，更加简单 

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <conio.h>
#include <windows.h>

#define snakeBirthLength 3 //最开始时刻蛇的长度
#define MatrixSize        12 //游戏背景大小

#define PAINTL        printf("|");printf("    ");
#define PAINTR        (printf("    |"));
#define PAINTTAIL    (paintTail())

#define LEVEL_1 50
#define LEVEL_2 200
#define LEVEL_3 500


int matrix[MatrixSize][MatrixSize];//-1 0(head) !0(body) -5(food)
int level;
                                 

void gameRun();
void reGame(int *go);
void gameOver();

void gameInit();//随机设置贪吃蛇的初始位置
void showMode(int num);
void paintHead(int num);
void paintTail();
void giveBirth(int *drt);
void makeFood();
int getRandNum(int max);//[0,max]随机数
void reaction(int *drt);//规定时间内是否响应
int moveOn(int drt, int *len);

int main()
{
    system("color 0B");
    gameRun();
    return 0;
}

void gameInit()
{
    int i, j;
    for (i = 0; i<MatrixSize; i++)
        for (j = 0; j<MatrixSize; j++)
            matrix[i][j] = -1;//
}
void gameRun()
{
    int drt;//direction
    int go = 1;

    while (go)
    {
        gameInit();
        giveBirth(&drt);
        makeFood();
        int snakeLen = snakeBirthLength, t;
        t = snakeLen;

        while (1) {
            if (t != snakeLen) {
                makeFood();
                t = snakeLen;
            }
            showMode(t - 3);
            reaction(&drt);//得到前进方向
            if (!moveOn(drt, &snakeLen))
                break;
            system("cls");
        }
        reGame(&go);
    }
    gameOver();
}
void reGame(int *go)
{
    printf("


----------------再开一局否?y/n _");
    char ch;
    while (1)
    {
        Sleep(10);
        if (!_kbhit())
            continue;
        else {
            ch = _getch();
            if (ch == 'y' || ch == 'Y')
            {
                Sleep(800);
                system("cls");
                return;
            }
            else if (ch == 'n' || ch == 'N')
            {
                Sleep(500);
                *go = 0;
                return;
            }
            else
                continue;
        }
    }
}
void gameOver()
{
    system("cls");
    printf("


	----------------输怕了吧 哈哈!------------------
");
    Sleep(3000);
}
void showMode(int num)
{
    int i, j;
    paintHead(num);
    for (i = 0; i<MatrixSize; i++) {
        printf("");
        PAINTL;
        for (j = 0; j < MatrixSize; j++)
            if (matrix[i][j] == -1)
                printf(".   ");
            else if (matrix[i][j] == 0)
                printf("4   ");
            else if (matrix[i][j] == -5)
                printf("#   ");
            else if (matrix[i][j] == -2)
                printf("!   ");
            else
                printf("0   ");
        PAINTR;
        printf("

");
    }
    PAINTTAIL;
}
void paintHead(int num)
{
    printf("
");
    int i;
    //第一行
    printf("+");
    printf("    ");
    for (i = 0; i<MatrixSize; i++)
        printf("=   ");
    printf("    ");
    printf("+
");
    printf("
");
    int len = 10 + MatrixSize * 4;
    for (int i = 0; i < len; i++)
        printf(" ");
    printf("	当前分数：%d
", num*10);
}
void paintTail()
{
    int i;
    //第一行
    printf("

");
    printf("+");
    printf("    ");
    for (i = 0; i<MatrixSize; i++)
        printf("=   ");
    printf("    ");
    printf("+
");
}
void giveBirth(int *drt)
{
    printf("（温馨提示：请将输入法改为英文输入法）
");
    printf("


	----------------游戏即将开始，请选择难易程度
");
    printf("


	----------------     高难度  输入1
");
    printf("


	----------------    一般难度 输入2
");
    printf("


	----------------     低难度  输入3
");
    printf("


	----------------请输入: _");
    char ch;
    ch = getchar();
    if (ch == '1')level = LEVEL_1;
    if (ch == '3') level = LEVEL_3;
    else level = LEVEL_2;
    while (getchar() != '
');

    system("cls");
    int i, j, k;
    int direction = getRandNum(3);//0上1下2左3右
    while (1)
    {
        i = getRandNum(MatrixSize - 1);//row
        j = getRandNum(MatrixSize - 1);//col
        if (direction == 0 && i - snakeBirthLength + 1 >= 0)
        {
            for (k = 0; k<snakeBirthLength; k++)
                if (k)
                    matrix[i - k][j] = k;
                else
                    matrix[i][j] = 0;//头
            *drt = 1;
            break;
        }
        if (direction == 1 && i + snakeBirthLength - MatrixSize <= 0)
        {
            for (k = 0; k<snakeBirthLength; k++)
                if (k)
                    matrix[i + k][j] = k;
                else
                    matrix[i][j] = 0;
            *drt = 0;
            break;
        }
        if (direction == 2 && j - snakeBirthLength + 1 >= 0)
        {
            for (k = 0; k<snakeBirthLength; k++)
                if (k)
                    matrix[i][j - k] = k;
                else
                    matrix[i][j] = 0;
            *drt = 3;
            break;
        }
        if (direction == 3 && j + snakeBirthLength - MatrixSize <= 0)
        {
            for (k = 0; k<snakeBirthLength; k++)
                if (k)
                    matrix[i][j + k] = k;
                else
                    matrix[i][j] = 0;
            *drt = 2;
            break;
        }
    }
}

void makeFood()
{
    int i, j;
    while (1)
    {
        i = getRandNum(MatrixSize - 1);
        j = getRandNum(MatrixSize - 1);
        if (matrix[i][j] == -1)
        {
            matrix[i][j] = -5;
            break;
        }
    }
}

int getRandNum(int max)
{
    srand((unsigned)time(NULL));
    return rand() % (max + 1);//[0,max]
}

void reaction(int * drt)
{
    char ch;
    Sleep(level);
    if (!_kbhit())
        return;
    else
    {
        ch = _getch();
        if (ch == 'w') *drt = 0;
        if (ch == 's') *drt = 1;
        if (ch == 'a') *drt = 2;
        if (ch == 'd') *drt = 3;
        return;
    }
}

int moveOn(int drt, int * len)
{
    int i, j, m, n;
    const int l = *len;
    int hr, hc, tr, tc;
    for (i = 0; i<MatrixSize; i++)
        for (j = 0; j<MatrixSize; j++)
            if (matrix[i][j] == 0)
            {
                hr = i, hc = j;
                break;
            }
    for (i = 0; i < MatrixSize; i++)
        for (j = 0; j < MatrixSize; j++)
            if (matrix[i][j] == l-1)
            {
                tr = i, tc = j;
                break;
            }

    i = hr, j = hc;
    //撞墙事故
    if (drt == 0 && i == 0) {
        system("cls");
        showMode(l - 3);
        printf("


	----------------头撞墙是也!------------------
");
        return 0;
    }
    if (drt == 1 && i == MatrixSize - 1) {
        system("cls");
        showMode(l - 3);
        printf("


	----------------头撞墙是也!------------------
");
        return 0;
    }
    if (drt == 2 && j == 0) {
        system("cls");
        showMode(l - 3);
        printf("


	----------------头撞墙是也!------------------
");
        return 0;
    }
    if (drt == 3 && j == MatrixSize - 1) {
        system("cls");
        showMode(l - 3);
        printf("


	----------------头撞墙是也!------------------
");
        return 0;
    }
    //咬身事故
    if (drt == 0 && matrix[i - 1][j]>0) {
        matrix[tr][tc] = -1;//头与身体重合
        matrix[i - 1][j] = -2;
        matrix[i][j] = 1;
        system("cls");
        showMode(l - 3);
        printf("


	----------------咬身事故也!------------------
");
        return 0;
    }
    if (drt == 1 && matrix[i + 1][j]>0) {
        matrix[tr][tc] = -1;
        matrix[i][j] = 1;
        matrix[i + 1][j] = -2;
        system("cls");
        showMode(l - 3);
        printf("


	----------------咬身事故也!------------------
");
        return 0;
    }
    if (drt == 2 && matrix[i][j - 1]>0) {
        matrix[tr][tc] = -1;
        matrix[i][j] = 1;
        matrix[i][j - 1] = -2;
        system("cls");
        showMode(l - 3);
        printf("


	----------------咬身事故也!------------------
");
        return 0;
    }
    if (drt == 3 && matrix[i][j + 1]>0) {
        matrix[tr][tc] = -1;
        matrix[i][j] = 1;
        matrix[i][j + 1] = -2;
        system("cls");
        showMode(l - 3);
        printf("


	----------------咬身事故也!------------------
");
        return 0;
    }
    //食食
    if (drt == 0 && matrix[i - 1][j] == -5)
    {
        *len = l + 1;
        matrix[i - 1][j] = -3;//头部预留
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;//新身++
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -3) {
                    matrix[m][n] = 0;//找头
                    break;
                }
        return 1;
    }
    if (drt == 1 && matrix[i + 1][j] == -5)
    {
        *len = l + 1;
        matrix[i + 1][j] = -3;//头部预留
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;//新身++
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -3) {
                    matrix[m][n] = 0;//找头
                    break;
                }
        return 1;
    }
    if (drt == 2 && matrix[i][j - 1] == -5)
    {
        *len = l + 1;
        matrix[i][j - 1] = -3;//头部预留
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;//新身++
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -3) {
                    matrix[m][n] = 0;//找头
                    break;
                }
        return 1;
    }
    if (drt == 3 && matrix[i][j + 1] == -5)
    {
        *len = l + 1;
        matrix[i][j + 1] = -3;//头部预留
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;//新身++
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -3) {
                    matrix[m][n] = 0;//找头
                    break;
                }
        return 1;
    }
    //正常走
    if (drt == 0 && matrix[i - 1][j] == -1)
    {
        matrix[i - 1][j] = -2;
        matrix[tr][tc] = -1;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -2)
                {
                    matrix[m][n] = 0;
                    break;
                }
        return 1;
    }
    if (drt == 1 && matrix[i + 1][j] == -1)
    {
        matrix[i + 1][j] = -2;
        matrix[tr][tc] = -1;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -2)
                {
                    matrix[m][n] = 0;
                    break;
                }
        return 1;
    }
    if (drt == 2 && matrix[i][j - 1] == -1)
    {
        matrix[i][j - 1] = -2;
        matrix[tr][tc] = -1;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -2)
                {
                    matrix[m][n] = 0;
                    break;
                }
        return 1;
    }
    if (drt == 3 && matrix[i][j + 1] == -1)
    {
        matrix[i][j + 1] = -2;
        matrix[tr][tc] = -1;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] >= 0)
                    matrix[m][n]++;
        for (m = 0; m < MatrixSize; m++)
            for (n = 0; n < MatrixSize; n++)
                if (matrix[m][n] == -2)
                {
                    matrix[m][n] = 0;
                    break;
                }
        return 1;
    }
    return 1;
}