C语言-分支与循环、函数、数组等知识点综合应用-C语言实现扫雷小游戏3.0

#define _CRT_SECURE_NO_WARNINGS 1 #include "game.h" //游戏主体 //初始化棋盘 void init_board(char board[ROWS][COLS], int rows, int cols, char ret) { for (int i = 0; i < rows; i++)//初始化行元素 { for (int j = 0; j < cols; j++)//初始化列元素 { board[i][j] = ret; } } } //打印棋盘 void print_board(char board[ROWS][COLS], int row, int col, int count) { printf("\n *---地雷 #---未排雷区域 P---旗帜\n\n"); printf("剩余地雷：%d\n", count); printf("|"); for (int i = 0; i <= row; i++)//打印列坐标 { printf(" %d |", i); } printf("\n"); //打印分割线 printf("|"); for (int j = 0; j <= col; j++)//打印列 { printf("---|"); } printf("\n"); for (int i = 1; i <= row; i++)//打印行 { printf("| %d |", i);//打印行号 for (int j = 1; j <= col; j++)//打印列 { printf(" "); printf("%c", board[i][j]); printf(" |"); } printf("\n"); //打印分割线 printf("|"); for (int j = 0; j <= col; j++)//打印列 { printf("---|"); } printf("\n"); } printf("\n"); } //埋地雷 void set_mine(char board[ROWS][COLS], int row, int col, char ret) { int count = COUNT;//地雷数量 while (count) { int flag = 0;//判断埋雷是否成功 int i = rand() % ROW + 1;//地雷横坐标 int j = rand() % COL + 1;//地雷纵坐标 if (i >= 1 && i <= row)//判断横坐标的合法性1-row { if (j >= 1 && j <= col)//判断纵坐标的合法性1-col { if (board[i][j] == ' ') { board[i][j] = ret; flag = 1;//成功埋雷 } } } if (flag) count--; } } //执行操作菜单 void menu2(int count) { printf("0.不执行任何操作 1.放置旗帜 2.排雷\n"); printf("请选择你要执行的操作>:"); } //执行操作菜单2 void menu3() { printf("0.不执行任何操作 1.取消旗帜 2.排雷\n"); printf("请选择你要执行的操作>:"); } //排雷 void find_mine(char shadow[ROWS][COLS], char mine[ROWS][COLS], int row, int col) { //用户输入横坐标 int x = 0; //用户输入纵坐标 int y = 0; //判断结果变量 char flag = 0; //统计排雷数量 int count = COUNT; //胜利标志 int win = 0; //未排雷数量 int num = 0; //开始排雷 while (1) { printf("请输入需要排查的坐标>:"); scanf("%d%d", &x, &y);//输入横纵坐标 //判断横坐标的合法性 if (x >= 1 && x <= row) { //判断纵坐标的合法性 if (y >= 1 && y <= col) { //该坐标未被排查 if (shadow[x][y] == '#') { menu2(count);//选择操作菜单 int input = 0; do { scanf("%d", &input);//输入操作 switch (input) { case 0://不执行任何操作 break; case 1: if (count) { shadow[x][y] = 'P';//标记坐标 count--; } break; case 2: flag = judge_mine(shadow, mine, row, col, x, y);//判断地雷 break; default: printf("无法执行未知操作，请重新输入:>");//错误提示 break; } if (input == 1 || input == 2) break; } while (input); //打印棋盘 print_board(shadow, ROW, COL, count); } //检查该坐标被排查，且为空 else if (shadow[x][y] == ' ') { printf("无效操作\n"); //打印棋盘 print_board(shadow, ROW, COL, count); } //该坐标被标记 else if (shadow[x][y] == 'P') { menu3(); int input = 0; do { scanf("%d", &input);//输入操作 switch (input) { case 0://不执行任何操作 break; case 1: shadow[x][y] = '#';//取消标记 count++; break; case 2: flag = judge_mine(shadow, mine, row, col, x, y);//判断地雷 break; default: printf("无法执行未知操作，请重新输入:>");//错误提示 break; } if (input == 1 || input == 2) break; } while (input); //打印棋盘 print_board(shadow, ROW, COL, count); } //该坐标被排查且有地雷数量统计 else { //打印棋盘 print_board(shadow, ROW, COL, count); printf("该坐标周围有%d个地雷\n", shadow[x][y] - '0'); } } } if (flag == 'L') { printf("你踩到了地雷,游戏失败\n"); break; } win = judge_win(shadow, row, col);//判断已排查数量 if ((win == ROW * COL - COUNT) && (count != 0))//当全部排查完，但是未全部标记 { count = auto_mark(shadow, row, col, count); } num = judge_win2(shadow, row, col); //找到并标记所有地雷 if ((win == ROW * COL - COUNT) && (count == 0) && (num == 0)) { //打印棋盘 print_board(shadow, ROW, COL, count); printf("恭喜你找出来所有的地雷，游戏胜利\n"); break; } } } //判断坐标 char judge_mine(char shadow[ROWS][COLS], char mine[ROWS][COLS], int row, int col, int x, int y) { if (mine[x][y] == '*') { shadow[x][y] = '*'; return 'L'; } else { //该坐标既未被排查，也不是地雷，统计该坐标周围地雷数 int ret = static_mine(shadow, mine, row, col, x, y); if (ret == 0) { shadow[x][y] = ' '; auto_find(shadow, mine, row, col, x, y); } else { shadow[x][y] = ret + '0'; } } return 'C'; } //通过坐标周围地雷数 int static_mine(char shadow[ROWS][COLS], char mine[ROWS][COLS], int row, int col, int x, int y) { int count = 0;//计数器 for (int i = -1; i < 2; i++)//横坐标判断 { for (int j = -1; j < 2; j++) { if (mine[x + i][y + j] == '*')//坐标点为地雷 count++;//计数器+1 } } return count; } //自动排雷 void auto_find(char shadow[ROWS][COLS], char mine[ROWS][COLS], int row, int col, int x, int y) { for (int i = -1; i < 2; i++) { if (x + i >= 1 && x + i <= row) { for (int j = -1; j < 2; j++) { if (y + j >= 1 && y + j <= col) { if (shadow[x + i][y + j] == '#') { judge_mine(shadow, mine, row, col, x + i, y + j); } } } } } } //判断胜利 int judge_win(char shadow[ROWS][COLS], int row, int col) { int count = 0; //已排查数量 for (int i = 1; i <= row; i++) { for (int j = 1; j <= row; j++) { if ((shadow[i][j] != '#') && (shadow[i][j] != 'P')) { count++; } } } return count; } //判断未排雷数量 int judge_win2(char shadow[ROWS][COLS], int row, int col) { int count = 0; //已排查数量 for (int i = 1; i <= row; i++) { for (int j = 1; j <= row; j++) { if (shadow[i][j] == '#') { count++; } } } return count; } //自动标记 int auto_mark(char shadow[ROWS][COLS], int row, int col, int count) { //已排查数量 for (int i = 1; i <= row; i++) { for (int j = 1; j <= row; j++) { if (shadow[i][j] == '#') { shadow[i][j] = 'P'; count--; } if (!count) return count; } } }