本文将介绍如何用C语言多文件编程实现扫雷
该示例扫雷程序可实现以下几个功能:
- 自定义雷数
- 踩雷后会将所有雷显示出来
- 地图大小易修改
Mine_clearance.h
|
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
|
#pragma once#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<time.h>#define ROW 11#define COL 11#define 踩雷 0#define 玩家胜利 1int g_number_mine = (ROW - 1)*(COL - 1); //雷的数量上限char map[ROW][COL]; //玩家看到的地图char mine_map[ROW + 2][COL + 2]; //雷阵void Init_map(); //初始化玩家看到的地图void Init_mine_map(int input_count); //初始化雷阵void Print_map(); //打印地图void Print_mine_map(); //如果踩雷需要把雷阵打印出来void Player_move(int row, int col); //提示玩家输入坐标开始游戏 1.合法性校验(是否越界)2.是否重复输入,(已经输入过的)int Judge_mine_end(int row, int col); //判断是否踩雷char Count_number_mine(int row, int col); //统计周围八个方块雷的个数void Print_mine_number(int row, int col, int n);//将周围八个方块雷的数量显示在当前方块上int Judge_win(int input_count); //判断是否获胜 |
Mine_clearance.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
|
#include "Mine_clearance.h"//初始化玩家看到的地图void Init_map(){ for (int row = 0; row <= ROW; ++row) { for (int col = 0; col <= COL; ++col) { map[row][col] = ' '; } }}//初始化雷阵void Init_mine_map(int input_count){ for (int row = 0; row < ROW; ++row) { for (int col = 0; col < COL; ++col) { mine_map[row][col] = ' '; } } srand((unsigned)time(NULL)); for (int i = 0; i < input_count; ++i) { int row = rand() % (ROW - 1) + 1; int col = rand() % (COL - 1) + 1; while (1) { if (mine_map[row][col] == 'x' && row == (ROW - 1) && col == (COL - 1)) { row = 1; col = 1; } else if (mine_map[row][col] == 'x' && (col == COL - 1)) { row += 1; col = 1; } else if (mine_map[row][col] == 'x' && (col < COL - 1)) { col++; } else { mine_map[row][col] = 'x'; break; } } }}//打印地图void Print_map(){ for (int i = 1; i < ROW; ++i) { printf(" %d ", i); } printf("\n|"); for (int j = 1; j < ROW; ++j) { printf("-----|"); } printf("\n"); int i = 1; for (int row = 1; row < ROW; ++row) { for (int col = 1; col < COL; ++col) { printf("| %c ", map[row][col]); } printf("|%d\n", i); for (int b = 1; b < ROW; ++b) { printf("|-----"); } printf("|"); printf("\n"); i = i + 1; }}//如果踩雷需要把雷阵打印出来void Print_mine_map(){ for (int i = 1; i < ROW; ++i) { printf(" %d ", i); } printf("\n|"); for (int j = 1; j < ROW; ++j) { printf("-----|"); } printf("\n"); int i = 1; for (int row = 1; row < ROW; ++row) { for (int col = 1; col < COL; ++col) { printf("| %c ", mine_map[row][col]); } printf("|%d\n", i); for (int b = 1; b < ROW; ++b) { printf("|-----"); } printf("|"); printf("\n"); i = i + 1; }}//提示玩家输入坐标开始游戏// 1.合法性校验(是否越界// 2.是否重复输入,(已经输入过的)void Player_move(int row, int col){ if (row < 1 || row >= ROW || col < 1 || col >= COL) { printf("非法输入!请重新输入\n"); } else if (map[row][col] == 'o') { printf("重复输入无效,请重新输入!\n"); } else { map[row][col] = 'o'; }}//判断是否踩雷int Judge_mine_end(int row, int col){ if (map[row][col] == 'o'&&mine_map[row][col] == 'x') { return 踩雷; } return 1;}//统计周围八个方块雷的个数char Count_number_mine(int row, int col){ int n = 0; for (int i = -1; i < 2; ++i) { for (int j = -1; j < 2; ++j) { if (mine_map[row + i][col + j] == 'x') { n += 1; } } } return n;}//将周围八个方块雷的数量显示在当前方块上void Print_mine_number(int row, int col, int n){ char num_mine[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8' }; switch (n){ case 0: map[row][col] = num_mine[0]; break; case 1: map[row][col] = num_mine[1]; break; case 2: map[row][col] = num_mine[2]; break; case 3: map[row][col] = num_mine[3]; break; case 4: map[row][col] = num_mine[4]; break; case 5: map[row][col] = num_mine[5]; break; case 6: map[row][col] = num_mine[6]; break; case 7: map[row][col] = num_mine[7]; break; case 8: map[row][col] = num_mine[8]; break; default: printf("雷数非法\n"); break; }}int Judge_win(int input_count){ int num_mine = 0; for (int row = 1; row < ROW; ++row) { for (int col = 1; col < COL; ++col) { if (map[row][col] != ' ') { num_mine += 1; } } } if (num_mine == (ROW - 1)*(COL - 1) - input_count) { return 玩家胜利; } return 2;} |
main.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
|
#include "Mine_clearance.h"int main(){ while (1) { int input_count = 0; int count_mine = 0; int row = 0; int col = 0; printf("自定义雷的个数:\n"); scanf("%d", &input_count); if (input_count < 1 || input_count >= g_number_mine) { printf("非法输入,请重新输入!\n"); } else { Init_mine_map(input_count); Init_map(); Print_map(); while (1) { printf("请输入坐标:(中间用空格隔开)\n"); scanf("%d %d", &row, &col); Player_move(row, col); if (Judge_mine_end(row, col) == 踩雷) { printf("踩雷了,游戏结束\n"); Print_mine_map(); break; } else { count_mine = Count_number_mine(row, col); Print_mine_number(row, col, count_mine); Print_map(); if (Judge_win(input_count) == 玩家胜利) { printf("你赢了!\n"); break; } } } } } system("pause"); return 0;} |
显示效果：
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：https://blog.csdn.net/weixin_42562387/article/details/89157790
