本文实例为大家分享了C语言推箱子游戏的具体实现代码，供大家参考，具体内容如下
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
|
#include <stdio.h>#include <stdlib.h>#include<string.h>#include <conio.h>//行和列 #define ROW 10#define COL 11/* run this program using the console pauser or add your own getch, system("pause") or input loop *//*****///地图char map[ROW][COL] = { "##########",//0 "### ##",//1 "### ##",//2 "##AX # ##",//3 "### ## ",//4 "##### #",//5 "## #",//6 "# ####",//7 "### ",//8 "##########" //9 //A:人 ， X：箱子 } ;//打印地图 void showMap();//接收小人的方向char enterDirection(); //小人向上移动的方法void moveToUp(); //小人向下移动的方法void moveToDown(); //小人向右移动的方法void moveToRight(); //小人向左移动的方法void moveToLeft(); //当前小人的坐标int currentPersonRow = 3;int currentPersonCol = 2;//当前箱子的坐标 int currentBoxRow = 3;int currentBoxCol = 3; int main(int argc, char *argv[]) { //system("clear"); printf("点击回车键开始游戏 ^_^\n\n"); //1代表运行 0停止 int flag = 1; while(flag==1){ //显示地图 showMap(); //接收小人的方向 char dir = enterDirection(); switch(dir){ //小人向上移动 case 'w': case 'W': moveToUp(); break; //小人向下移动 case 's': case 'S': moveToDown(); break; //小人向右移动 case 'd': case 'D': moveToRight(); break; //小人向左移动 case 'a': case 'A': moveToLeft(); break; //停止运行 case 'q': case 'Q': printf("你的智商真低！T_T\n"); flag = 0; break; } showMap(); if(currentBoxRow==8&¤tBoxCol==9){ printf("你的智商真高^_^!!!"); flag = 0; } } }/*方法的实现 */ //打印地图 void showMap(){ int i; for(i = 0;i < ROW; i++){ printf("%s\n",map[i]); } printf("\n\n\n\n\n"); printf("W:上，S：下， A：左， D：右。Q：退出"); printf("\n\n\n\n\n");}//接收小人的方向char enterDirection(){ //清除SCANF中的缓冲区 rewind(stdin); char dir; dir = getch(); //scanf("%c",&dir); return dir;}//小人向上移动的方法void moveToUp(){ //小人的下一个坐标 int nextPersonCol = currentPersonCol; int nextPersonRow = currentPersonRow - 1; //箱子的下一个坐标 int nextBoxRow = currentBoxRow - 1; int nextBoxCol = currentBoxCol; //如果小人的下一个坐标是路 if(map[nextPersonRow][nextPersonCol]==' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; } //如果小人的下一个坐标是墙 if(map[nextPersonRow][nextPersonCol]=='#'){ //什么也不做 } //如果小人的下一个坐标是箱子 if(map[nextPersonRow][nextPersonCol]=='X'){ if(map[nextBoxRow][nextBoxCol] == ' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; map[nextBoxRow][nextBoxCol] = 'X'; map[currentBoxRow][currentBoxCol] = 'A'; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; currentBoxRow = nextBoxRow; currentBoxCol = nextBoxCol; } }}//小人向下移动的方法void moveToDown(){ //小人的下一个坐标 int nextPersonCol = currentPersonCol; int nextPersonRow = currentPersonRow + 1; //箱子的下一个坐标 int nextBoxRow = currentBoxRow + 1; int nextBoxCol = currentBoxCol; //如果小人的下一个坐标是路 if(map[nextPersonRow][nextPersonCol]==' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; } //如果小人的下一个坐标是墙 if(map[nextPersonRow][nextPersonCol]=='#'){ //什么也不做 } //如果小人的下一个坐标是箱子 if(map[nextPersonRow][nextPersonCol]=='X'){ if(map[nextBoxRow][nextBoxCol] == ' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; map[nextBoxRow][nextBoxCol] = 'X'; map[currentBoxRow][currentBoxCol] = 'A'; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; currentBoxRow = nextBoxRow; currentBoxCol = nextBoxCol; } }} //小人向右移动的方法void moveToRight(){ //小人的下一个坐标 int nextPersonCol = currentPersonCol + 1; int nextPersonRow = currentPersonRow; //箱子的下一个坐标 int nextBoxRow = currentBoxRow; int nextBoxCol = currentBoxCol + 1; //如果小人的下一个坐标是路 if(map[nextPersonRow][nextPersonCol]==' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; } //如果小人的下一个坐标是墙 if(map[nextPersonRow][nextPersonCol]=='#'){ //什么也不做 } //如果小人的下一个坐标是箱子 if(map[nextPersonRow][nextPersonCol]=='X'){ if(map[nextBoxRow][nextBoxCol]==' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; map[nextBoxRow][nextBoxCol] = 'X'; map[currentBoxRow][currentBoxCol] = 'A'; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; currentBoxRow = nextBoxRow; currentBoxCol = nextBoxCol; } }}//小人向左移动的方法void moveToLeft(){ //小人的下一个坐标 int nextPersonCol = currentPersonCol - 1; int nextPersonRow = currentPersonRow; //箱子的下一个坐标 int nextBoxRow = currentBoxRow; int nextBoxCol = currentBoxCol - 1; //如果小人的下一个坐标是路 if(map[nextPersonRow][nextPersonCol]==' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; } //如果小人的下一个坐标是墙 if(map[nextPersonRow][nextPersonCol]=='#'){ //什么也不做 } //如果小人的下一个坐标是箱子 if(map[nextPersonRow][nextPersonCol]=='X'){ if(map[nextBoxRow][nextBoxCol]==' '){ map[nextPersonRow][nextPersonCol] = 'A'; map[currentPersonRow][currentPersonCol] = ' '; map[nextBoxRow][nextBoxCol] = 'X'; map[currentBoxRow][currentBoxCol] = 'A'; currentPersonRow = nextPersonRow; currentPersonCol = nextPersonCol; currentBoxRow = nextBoxRow; currentBoxCol = nextBoxCol; } }} |
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：https://blog.csdn.net/Pastthewind/article/details/52456178
