#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#define MAX_ROW 9
#define MAX_COL 9
#define MINE_COUNT 10
//创建两个二维数组
//1.翻开:数字 未翻开:*
//2 地雷的布局` 0:地雷` 1.不是地雷
//核心流程:1.创建地图并初始化,对于show_map全是*,对于mine_map,初始10个雷
//2.打印地图
//3.输入坐标
//4.尝试翻开 是地雷:游戏结束 不是:更新show_map,给当前数字,是不是最后一个
//5.循环进行
void Init(char show_map[MAX_ROW][MAX_COL],
char mine_map[MAX_ROW][MAX_COL]){
//1.show_map全*
for (int row = 0; row < MAX_ROW; row++){
for (int col = 0; col < MAX_COL; col++){
show_map[row][col] = '*';
}
}
//2.mine_map先全为0,在随机生成
for (int row = 0; row < MAX_ROW; row++){
for (int col = 0; col < MAX_COL; col++){
mine_map[row][col] = '0';
}
}
int count = MINE_COUNT;
while (count>0){
int row = rand() % MAX_ROW;
int col = rand() % MAX_COL;
if (mine_map[row][col] == '1'){
continue;
}
mine_map[row][col] = '1';
--count;
}
}
void PrintMap(char map[MAX_ROW][MAX_COL]){
system("cls");
printf(" | ");
for (int col = 0; col < MAX_COL; col++){
printf("%d ", col);
}
printf("\n");
printf("------------------------\n");
for (int row = 0; row < MAX_ROW; row++){
printf(" %d | ", row);
for (int col = 0; col < MAX_COL; col++){
printf("%c ", map[row][col]);
}
printf("\n");
}
}
void GetPos(char show_map[MAX_ROW][MAX_COL],int* row, int* col){
while (1){
printf("请输入一组坐标:\n");
scanf("%d %d", row, col);//指针类型,不用取地址符
if (*row < 0 || *row >= MAX_ROW || *col < 0 || *col >= MAX_COL){
printf("你的输入有误,请重新输入!\n");
continue;
}
if (show_map[*row][*col] != '*'){
printf("你输入的位置已经翻开,请重新输入!\n");
continue;
}
break;
}
}
void UpdateMap(char show_map[MAX_ROW][MAX_COL], char mine_map[MAX_ROW][MAX_COL],
int row, int col){
//周围有几个雷
int mine_count = 0;
if (row - 1 >= 0 && col - 1 >= 0 &&
mine_map[row - 1][col - 1] == '1'){
++mine_count;
}
if (row - 1 >= 0 && mine_map[row - 1][col] == '1'){
++mine_count;
}
if (row - 1 >= 1 && col + 1 < MAX_COL&&mine_map[row - 1][col + 1] == '1'){
++mine_count;
}
if (col-1>=0&&mine_map[row][col - 1] == '1'){
++mine_count;
}
if (col+1<MAX_COL&&mine_map[row][col + 1] == '1'){
++mine_count;
}
if (row + 1 < MAX_ROW&&col-1>=0&&mine_map[row + 1][col - 1] == '1'){
++mine_count;
}
if (row + 1 < MAX_ROW&&mine_map[row + 1][col] == '1'){
++mine_count;
}
if (row+1<MAX_ROW&&col+1<MAX_COL&&mine_map[row + 1][col + 1] == '1'){
++mine_count;
}
show_map[row][col] = mine_count + '0';
}
void Game(){
char show_map[MAX_ROW][MAX_COL];
char mine_map[MAX_ROW][MAX_COL];
Init(show_map, mine_map);
int safe_count = 0;
while (1){
PrintMap(show_map);
int row = 0;
int col = 0;
GetPos(show_map, &row, &col);
if (mine_map[row][col] == '1'){
PrintMap(mine_map);
printf("游戏结束!\n");
break;
}
++safe_count;
if (safe_count == MAX_ROW*MAX_COL - MINE_COUNT){
printf("游戏胜利!\n");
break;
}
UpdateMap(show_map,mine_map,row,col);
}
}
int main(){
Game();
system("pause");
return 0;
}
扫雷
最新推荐文章于 2025-05-15 00:33:07 发布