瞎写的试手,日后改进。
#include<iostream>
#include<queue>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<vector>
#include<conio.h>
#include<Windows.h>
using namespace std;
char yidong='d';
int board[20][20];
int appx=8, appy=8;
struct she {
int x;
int y;
};
she cao, head;
vector<she> vi;
void tprintf() {
for (int i = 0; i < 20; i++) {
for (int j = 0; j < 20; j++) {
printf("%c ", board[i][j]);
}
printf("\n");
}
printf("\n\n\n\n");
}
bool peng(struct she cao) {
if (cao.x == appx && cao.y == appy)
return true;
else
return false;
}
int main() {
vector<she>::iterator it;
for (int i = 0; i < 20; i++)
for (int j = 0; j < 20; j++)
board[i][j] = 32;
board[appx][appy] = 36;
head.x = 5;
head.y = 5;
board[head.x][head.y] = 64;;
tprintf();
vi.push_back(head);
while (1) {
//fflush(stdin);
if (kbhit()) {
fflush(stdin);
//printf("reete");
yidong = getche();
}
//yidong = getche();
//getchar();
if (yidong == 'd') {
cao.x = head.x;
cao.y = head.y + 1;
}
else if (yidong == 'a') {
cao.x = head.x;
cao.y = head.y - 1;
}
else if (yidong == 's') {
cao.x = head.x + 1;
cao.y = head.y;
}
else if (yidong == 'w') {
cao.x = head.x - 1;
cao.y = head.y;
}
board[cao.x][cao.y] = 64;
head = cao;
//printf("dfgdg\n");
vi.insert(vi.begin(), cao);
if (!peng(cao)) {
it = vi.end() - 1;
board[it->x][it->y] = 32;
vi.pop_back();
}
Sleep(2000);
tprintf();
}
return 0;
}