ubuntu下写的，在linux shell可运行 ，想编译请安装
libncurses5-dbg libncurses5-dev
使用参数 ： g++ -lcurses snake.c 编译
方向键使用vim 默认的hjkl进行移动，可以熟悉vim的方向键
菜单中 L 是确定 ，游戏中q是退出
1
1 #include <unistd.h>
2 2 #include <stdio.h>
3 3 #include <stdlib.h>
4 4 #include <curses.h>
5 5 #include <time.h>
6 6
7 7 #define LEFT 3
8 8 #define RIGHT 1
9 9 #define UP 2
10 10 #define DOWN 0
11 11
12 12 //snake length
13 13 #define N 800
14 14
15
15 struct node 
{
16
16 int x, y;
17 17 node *next;
18
18 node() {
19 19 next = NULL;
20 20 } node(int a, int b) {
21 21 x = a;
22 22 y = b;
23 23 next = NULL;
24
24 }
25
25 };
26 26
27 27 struct node snake[N];
28 28 struct node food;
29 29 node *fr = &snake[0], *to = &snake[2]; //头尾
30 30
31 31 inline void message(int x, int y, char t)
32 32 {
33 33 move(x, y);
34 34 addch(t);
35 35 }
36 36
37 37 int SPEED; //速度
38 38 int dir[4][2] = { {1, 0}, {0, 1}, {-1, 0}, {0, -1} };
39 39
40 40 int acc = 0;
41 41 int pre;
42 42 int top;
43 43 int n = 20, m = 60;
44 44 int score;
45 45 bool first_time;
46 46 timespec delay;
47 47 timespec dummy;
48 48
49 49 void genFood()
50 50 {
51 51 int i;
52 52 bool flag;
53 53 do {
54 54 flag = false;
55 55 food.x = rand() % (n - 2) + 1;
56 56 food.y = rand() % (m - 2) + 1;
57 57
58 58 for (i = 0; i < top; i++) {
59 59 if (food.x == snake[i].x || food.y == snake[i].y) {
60 60 flag = true; break;
61 61 }
62 62 }
63 63 } while (flag);
64 64 }
65 65
66 66 void handle_crash()
67 67 {
68 68 clear();
69 69 move(n / 2 + 1, 20);
70 70 printw("You Crashed");
71 71 move(n / 2 + 2, 20);
72 72 printw("Score: %d", score);
73 73
74 74 first_time = true;
75 75 refresh();
76 76 sleep(2);
77 77 clear();
78 78 }
79 79
80 80 void init()//初始游戏
81 81 {
82 82 snake[0] = node(10, 10);
83 83 snake[1] = node(10, 11);
84 84 snake[2] = node(10, 12);
85 85
86 86 snake[0].next = &snake[1];
87 87 snake[1].next = &snake[2];
88 88 snake[2].next = NULL;
89 89
90 90 score = 0;
91 91 SPEED = 30;
92 92 top = 3;
93 93 pre = 0;
94 94 fr = &snake[0];
95 95 to = &snake[2];
96 96
97 97 genFood();
98 98 }
99 99
100100 bool game() // 游戏函数
101101 {
102102
103103 int i, j, k;
104104 int t;
105105 bool crash;
106106 bool flag = true;
107107
108108 node *temp;
109109
110110 clear();
111111 nodelay(stdscr, true);
112112
113113 if (first_time) {
114114 init();
115115 first_time = false;
116116 }
117117
118118 for (i = 1; i < m; i++) {
119119 message(n, i, '-');
120120 message(0, i, '-');
121121 }
122122 for (i = 1; i < n; i++) {
123123 message(i, m, '|');
124124 message(i, 0, '|');
125125 }
126126
127127 while (1) {
128128 delay.tv_nsec = 10000000 * SPEED;
129129 t = getch();
130130 switch (t) {
131131 case 'h': t = LEFT; break;
132132 case 'j': t = DOWN; break;
133133 case 'k': t = UP; break;
134134 case 'l': t = RIGHT; break;
135135 case 'q': return false; break;
136136 }
137137
138138 //erase
139139 message(fr->x, fr->y, ' ');
140140
141141 if (flag) {
142142 if (t >= 0 && t <= 3 && !(abs(t - pre) == 2)) { // 转向
143143 fr->x = to->x + dir[t][0];
144144 fr->y = to->y + dir[t][1];
145145 temp = fr;
146146 fr = fr->next;
147147 temp->next = NULL;
148148 to->next = temp;
149149 to = temp;
150150 pre = t;
151151 } else {
152152 fr->x = to->x + dir[pre][0];
153153 fr->y = to->y + dir[pre][1];
154154 temp = fr;
155155 fr = fr->next;
156156 temp->next = NULL;
157157 to->next = temp;
158158 to = temp;
159159 }
160160 } else {
161161 if (t >= 0 && t <= 3 && !(abs(t - pre) == 2)) { // 转向
162162 snake[top] = (*to);
163163 to->next = &snake[top];
164164 to = &snake[top++];
165165 to->x = to->x + dir[t][0];
166166 to->y = to->y + dir[t][1];
167167 pre = t;
168168 } else {
169169 snake[top] = (*to);
170170 to->next = &snake[top];
171171 to = &snake[top++];
172172 to->x = to->x + dir[pre][0];
173173 to->y = to->y + dir[pre][1];
174174 }
175175 flag = true;
176176 }
177177
178178 if (to->x == food.x && to->y == food.y) {
179179 score += 50 - SPEED;
180180 genFood();
181181 flag = false;
182182 if (acc++ > 3) acc = 0;
183183
184184 SPEED--;
185185 }
186186
187187 if (1) //debug
188188 {
189189 move(n + 1, 0);
190190 printw("score: %d\n", score);
191191 printw("x:%d\ty:%d\n", to->x, to->y);
192192 printw("x:%d\ty:%d\n", food.x, food.y);
193193
194194 }
195195
196196 crash = false;
197197 if (to->x >= n || to->y >= m || to->x <= 0 || to->y <= 0) //撞墙
198198 crash = true;
199199 if (!crash) { //自撞
200200 for (node * now = fr; now != to; now = now->next) {
201201 if (now->x == to->x && now->y == to->y) {
202202 crash = true;
203203 break;
204204 }
205205 }
206206 }
207207
208208 if (crash) { //撞上
209209 handle_crash();
210210 break;
211211 }
212212
213213 message(food.x, food.y, '@');
214214 for (i = 0; i < top; i++)
215215 message(snake[i].x, snake[i].y, '*');
216216
217217 move(to->x, to->y); //移动到蛇头
218218 refresh();
219219 nanosleep(&delay, &dummy);//休眠一定时间
220220 }
221221
222222 nodelay(stdscr, false);
223223 return true;
224224 }
225225
226226 bool menu()//菜单
227227 {
228228 const int M = 3;
229229 char str[M][20] = {
230230 "Start a new game",
231231 "Continue",
232232 "Quit"
233233 };
234234 int coor[M][2] = {
235235 {3, 2},
236236 {5, 2},
237237 {7, 2}
238238 };
239239
240240 int now = 0;
241241 int t;
242242 first_time = true;
243243 while (1) {
244244 switch (t) {
245245 case 'j': //上
246246 {
247247 now++;
248248 if (first_time && now == 1) now = 2;
249249 if (now >= M) now = M - 1;
250250 break;
251251 }
252252 case 'k': //下
253253 {
254254 now--;
255255 if (first_time && now == 1) now = 0;
256256 if (now < 0) now = 0;
257257 break;
258258 }
259259 case 'l': //右
260260 {
261261 switch (now) {
262262 case 0: first_time = true; game(); break;
263263 case 1: game(); break;
264264 case 2: return true; break;
265265
266266 }
267267 now =0;
268268 break;
269269 }
270270 }
271271
272272 move(coor[0][0], coor[0][1]); printw("%s", str[0]);
273273 if (!first_time) {
274274 move(coor[1][0], coor[1][1]); printw("%s", str[1]); }
275275 move(coor[2][0], coor[2][1]); printw("%s", str[2]);
276276
277277 attron(A_STANDOUT); //反色
278278 move(coor[now][0], coor[now][1]); printw("%s", str[now]);
279279 attroff(A_STANDOUT);
280280
281281 refresh();
282282 t = getch();
283283
284284 }
285285 return false;
286286 }
287287
288288 int main()
289289 {
290290 initscr();
291291 srand((unsigned int)time(NULL));
292292 delay.tv_sec = 0;
293293
294294 crmode(); //模式调整
295295 noecho();
296296 keypad(stdscr, TRUE);
297297
298298 menu();//主过程
299299
300300 refresh();
301301 endwin();
302302 exit(EXIT_SUCCESS);
303303 }
304304