简单推箱子C++代码实现

#include<iostream>
#include<cstdlib>
#include<conio.h>
#define N 20
using namespace std;
int main(void)
{
	//
	//											//
	//	空地:			0						//
	//	墙:				1	■					//
	//	目的地:			3	☆					//
	//	箱子:			4	★					//
	//	人的位置:		5	▽					//
	//	箱子到达目的地:	7	●					//
	//											//
	//
	int i, j;
	int map[N][N] =
	{
		1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,//第1行
		1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,//第2行
		1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,//第3行
		1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,//第4行
		1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,//第5行
		1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,//第6行
		1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,//第7行
		1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,//第8行
		1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,//第9行
		1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,//第10行
		1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,//第11行
		1,1,0,0,1,0,0,1,1,1,1,1,1,1,1,1,1,0,0,1,//第12行
		1,1,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1,0,0,1,//第13行
		1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,//第14行
		1,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,1,//第15行
		1,0,0,0,0,1,1,0,0,1,1,0,1,1,0,0,1,0,0,1,//第16行
		1,0,4,0,0,1,1,0,0,1,1,0,0,1,0,0,1,0,0,1,//第17行
		1,0,5,0,0,1,1,0,0,1,1,1,0,1,0,0,0,0,0,1,//第18行
		1,0,0,0,0,1,1,0,0,0,0,0,3,1,0,0,0,0,0,1,//第19行
		1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 //第20行
	};
	while (1)
	{
		for (i = 0; i < N; i++)
		{
			for (j = 0; j < N; j++)
			{
				switch (map[i][j])
				{
				case 0:cout << "  "; break;
				case 1:cout << "■"; break;
				case 3:cout << "☆"; break;
				case 4:cout << "★"; break;
				case 5:cout << "▽"; break;
				case 7:cout << "●"; break;
				case 8:cout << "▽"; break;
				}
			}
			cout << '\n';
		}
		for (i = 0; i < N; i++)
		{
			for (j = 0; j < N; j++)
			{
				if (map[i][j] == 5 || map[i][j] == 8)
					goto next;
			}
		}
	next:cout << "当前人所在坐标为:" << i + 1 << " " << j + 1<<endl;
		if (map[18][12] == 7)
		{		
			cout <<  "你胜利了！" << endl;
			return 0;
		}
		char usekey = _getch();
		switch (usekey)
		{
		case 'W':
		case 'w':
		case 72:
			if (map[i - 1][j] == 0 || map[i - 1][j] == 3)
			{
				map[i][j] -= 5;
				map[i - 1][j] += 5;
			}
			if (map[i - 1][j] == 4 || map[i - 1][j] == 7)
			{
				if (map[i - 2][j] == 0 || map[i - 2][j] == 3)
				{
					map[i][j] -= 5;
					map[i - 1][j] += 1;
					map[i - 2][j] += 4;
				}
			}
			break;
		case 'S':
		case 's':
		case 80:
			if (map[i + 1][j] == 0 || map[i + 1][j] == 3)
			{
				map[i][j] -= 5;
				map[i + 1][j] += 5;
			}
			if (map[i+1][j] == 4 || map[i+1][j] == 7)
			{
				if (map[i+2][j] == 0 || map[i+2][j] == 3)
				{
					map[i][j] -= 5;
					map[i+1][j] += 1;
					map[i+2][j] += 4;
				}
			}
			break;
		case 'A':
		case 'a':
		case 75:
			if (map[i][j - 1] == 0 || map[i][j - 1] == 3)
			{
				map[i][j] -= 5;
				map[i][j - 1] += 5;
			}
			if (map[i][j - 1] == 4 || map[i][j - 1] == 7)
			{
				if (map[i][j - 2] == 0 || map[i][j - 2] == 3)
				{
					map[i][j] -= 5;
					map[i][j - 1] += 1;
					map[i][j - 2] += 4;
				}
			}
			break;
		case 'D':
		case 'd':
		case 77:
			if (map[i][j + 1] == 0 || map[i][j + 1] == 3)
			{
				map[i][j] -= 5;
				map[i][j + 1] += 5;
			}
			if (map[i][j + 1] == 4 || map[i][j + 1] == 7)
			{
				if (map[i][j + 2] == 0 || map[i][j + 2] == 3)
				{
					map[i][j] -= 5;
					map[i][j + 1] += 1;
					map[i][j + 2] += 4;
				}
			}
			break;
		}
		system("cls");
	}
}