[C++知识库]C语言小项目----＞ 推箱子

C语言小项目----> 推箱子
二维指针之前知识实现，需要的可以看看。注释已经附上，文章不再赘述代码思路。

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define SPACE 0 //空地
#define WALL  1 //墙
#define DEST  2 //目的地
#define BOX   3 //箱子
#define PLAYER 4 //玩家
//关卡数目 
int level = 0;
//通过分析可以得出，数据使用二维数组存储的  三个关卡 
int map[3][10][10] =
{
	{
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,1,1,1,0,0,0,0,
		0,0,0,1,2,1,0,0,0,0,
		0,0,0,1,0,1,0,0,0,0,
		0,1,1,1,3,1,1,1,1,0,
		0,1,2,3,4,0,3,2,1,0,
		0,1,1,1,1,3,1,1,1,0,
		0,0,0,0,1,2,1,0,0,0,
		0,0,0,0,1,1,1,0,0,0,
		0,0,0,0,0,0,0,0,0,0
	},
		{
		0,0,0,0,0,0,0,0,0,0,
		0,0,1,1,0,0,1,1,0,0,
		0,1,0,0,1,1,0,0,1,0,
		1,0,2,0,4,0,0,2,0,1,
		1,0,0,3,0,0,3,0,0,1,
		0,1,0,3,0,0,3,0,1,0,
		0,0,1,0,0,0,0,1,0,0,
		0,0,0,1,2,2,1,0,0,0,
		0,0,0,0,1,1,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0
	},
		{
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0,
		0,0,0,0,0,0,0,0,0,0
	}
};
void draw()
{
	for (int i = 0; i < 10; i++)
	{
		for (int k = 0; k < 10; k++)
		{
			switch (map[level][i][k])
			{
			case SPACE:
				printf("  ");
				break;
			case WALL:
				printf("▓");
				break;
			case DEST:
				printf("☆");
				break;
			case BOX:
				printf("★");
				break;
			case PLAYER:
				printf("♀");
				break;
			case BOX+DEST:
				printf("卐");
				break;
			case PLAYER + DEST:
				printf("♂");
				break;
			}

		}
		printf("\n");
	}
}
//移动
void move()
{
	//先找玩家
	int i = 0, k = 0;
	for (i = 0; i < 10; i++)
	{
		for (k = 0; k < 10; k++)
		{
			if (map[level][i][k] == PLAYER || map[level][i][k] == PLAYER+DEST)
			{
				goto end;
			}
		}
	}
end:;
	//获取键盘输入  scanf  getchar ..  不合适，这些函数输入之后需要按回车
	//_getch();   这个函数需要conio.h头文件，这个头文件不是C语言标准的
	char key = _getch();
	switch (key)
	{
	case 'W':
	case 'w':
	case 72://上
		//先判断玩家能不能动，玩家的前面是不是空地，或者目的地
		if (map[level][i - 1][k] == SPACE || map[level][i - 1][k] == DEST)
		{
			map[level][i - 1][k] += PLAYER;
			map[level][i][k] -= PLAYER;
		}
		//玩家前面是箱子,或者箱子在目的地上，都可以推动箱子
		else if (map[level][i - 1][k] == BOX || map[level][i - 1][k] == BOX + DEST)
		{
			//箱子前面是什么 空地？ 墙？
			if (map[level][i - 2][k] == SPACE || map[level][i - 2][k] == DEST)
			{
				map[level][i - 2][k] += BOX;	//移动箱子到空地或者是目的地
				map[level][i - 1][k] -= BOX;	//把箱子干掉
				map[level][i - 1][k] += PLAYER;
				map[level][i][k] -= PLAYER;
			}
		}
		break;
	case 'S':
	case 's':
	case 80://下
		//先判断玩家能不能动，玩家的前面是不是空地，或者目的地
		if (map[level][i+1][k] == SPACE || map[level][i+1][k] == DEST)
		{
			map[level][i+1][k] += PLAYER;
			map[level][i][k] -= PLAYER;
		}
		//玩家前面是箱子,或者箱子在目的地上，都可以推动箱子
		else if (map[level][i+1][k] == BOX || map[level][i+1][k] == BOX + DEST)
		{
			//箱子前面是什么 空地？ 墙？
			if (map[level][i+2][k] == SPACE || map[level][i+2][k] == DEST)
			{
				map[level][i+2][k] += BOX;	//移动箱子到空地或者是目的地
				map[level][i+1][k] -= BOX;	//把箱子干掉
				map[level][i+1][k] += PLAYER;
				map[level][i][k] -= PLAYER;
			}
		}
		break;
	case 'A':
	case 'a':
	case 75://左
		//先判断玩家能不能动，玩家的前面是不是空地，或者目的地
		if (map[level][i][k - 1] == SPACE || map[level][i][k - 1] == DEST)
		{
			map[level][i][k - 1] += PLAYER;
			map[level][i][k] -= PLAYER;
		}
		//玩家前面是箱子,或者箱子在目的地上，都可以推动箱子
		else if (map[level][i][k - 1] == BOX || map[level][i][k - 1] == BOX + DEST)
		{
			//箱子前面是什么 空地？ 墙？
			if (map[level][i][k - 2] == SPACE || map[level][i][k - 2] == DEST)
			{
				map[level][i][k - 2] += BOX;	//移动箱子到空地或者是目的地
				map[level][i][k - 1] -= BOX;	//把箱子干掉
				map[level][i][k - 1] += PLAYER;
				map[level][i][k] -= PLAYER;
			}
		}
		break;
	case 'D':
	case 'd':
	case 77://右
		//先判断玩家能不能动，玩家的前面是不是空地，或者目的地
		if (map[level][i][k + 1] == SPACE || map[level][i][k + 1] == DEST)
		{
			map[level][i][k + 1] += PLAYER;
			map[level][i][k] -= PLAYER;
		}
		//玩家前面是箱子,或者箱子在目的地上，都可以推动箱子
		else if(map[level][i][k+1] == BOX || map[level][i][k + 1] == BOX+DEST)
		{
			//箱子前面是什么 空地？ 墙？
			if (map[level][i][k + 2] == SPACE || map[level][i][k + 2] == DEST)
			{
				map[level][i][k + 2] += BOX;	//移动箱子到空地或者是目的地
				map[level][i][k + 1] -= BOX;	//把箱子干掉
				map[level][i][k + 1] += PLAYER;
				map[level][i][k] -= PLAYER;
			}
		}
		break;
	}
}
//判断是否过关
int jude()
{
	for (int i = 0; i < 10; i++)
	{
		for (int k = 0; k < 10; k++)
		{
			if (map[level][i][k] == BOX)
			{
				return 0;
			}
		}
	}
	return 1;
}
int main()
{
	
	while (1)
	{
		system("cls");
		draw();
		if (jude())
		{
			level++;
			if (level >= 3)
			{
				printf("you win~");
				return 666;
			}
		}
		move();
	}

	getchar();
	return 0;
}