C语言扫雷(展开功能)

使用递归连续排查坐标周围雷的数量

注意点:

1. 函数需返回与判断“排雷成功”条件相关的值(此处为“last”,即剩余需排查的雷的数量)

2. 展开功能中所排查坐标的合法性,应为1~ROW、1~COL【ROW:布雷棋盘行数,COL:布雷棋盘列数】

int UnfoldMine(char show[ROWS][COLS], char mine[ROWS][COLS], int r, int c, int x, int y, int last)//因排雷成功条件为“last==0”,故需返回last以更新last值
{
	int num = CountMine(mine, x, y);
	show[x][y] = num + '0';
	last--;
	if (num == 0)
	{
		int i = 0;
		for (i = x - 1; i <= x + 1; i++)
		{
			int j = 0;
			for (j = y - 1; j <= y + 1; j++)
			{
				if (i >= 1 && i <= r && j >= 1 && j <= c)//确保展开坐标合法
				{
					if (show[i][j] == '*')
					{
						last = UnfoldMine(show, mine, ROW, COL, i, j, last);
					}
				}
			}
		}
	}
	return last;
}

 此外,若需将展开部分显示为空白,可考虑使用分支语句,将“show[x][y] = num + '0';”改为“if (num == 0){show[x][y] = ' ';} else{show[x][y] = num + '0';}”:

完整代码 

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
#include <time.h>


#define ROW 9
#define COL 9
#define ROWS ROW+2
#define COLS COL+2

#define EASY_NUM 3

void InitBoard(char board[ROWS][COLS], int r, int c, char x)
{
	int i = 0;
	for (i = 0; i < r; i++)
	{
		int j = 0;
		for (j = 0; j < c; j++)
		{
			board[i][j] = x;
		}
	}
}

void DisplayBoard(char board[ROWS][COLS], int r, int c)
{
	int i = 0;
	printf("----MINESWEEPER----\n");
	for (i = 0; i <= c; i++)
	{
		printf("%d ", i);
	}
	printf("\n");
	for (i = 1; i <= r; i++)
	{
		printf("%d ", i);
		int j = 0;
		for (j = 1; j <= c; j++)
		{
			printf("%c ", board[i][j]);
		}
		printf("\n");
	}
}

void SetMine(char mine[ROWS][COLS], int r, int c, int num)
{
	int m = 0, n = 0;
	while (num)
	{
		m = rand() % r + 1;
		n = rand() % c + 1;
		if (mine[m][n] == '0')
		{
			mine[m][n] = '1';
			num--;
		}
	}
}

int CountMine(char mine[ROWS][COLS], int x, int y)
{
	return mine[x - 1][y - 1] + mine[x - 1][y] + mine[x - 1][y + 1] +
		mine[x][y - 1] + mine[x][y + 1] +
		mine[x + 1][y - 1] + mine[x + 1][y] + mine[x + 1][y + 1] - 8 * '0';
}

int UnfoldMine(char show[ROWS][COLS], char mine[ROWS][COLS], int r, int c, int x, int y, int last)
{
	int num = CountMine(mine, x, y);
	show[x][y] = num + '0';
	last--;
	if (num == 0)
	{
		int i = 0;
		for (i = x - 1; i <= x + 1; i++)
		{
			int j = 0;
			for (j = y - 1; j <= y + 1; j++)
			{
				if (i >= 1 && i <= r && j >= 1 && j <= c)
				{
					if (show[i][j] == '*')
					{
						last = UnfoldMine(show, mine, ROW, COL, i, j, last);
					}
				}
			}
		}
	}
	return last;
}

void FindMine(char mine[ROWS][COLS], char show[ROWS][COLS], int r, int c, int num)
{
	int x = 0, y = 0;
	int last = ROW * COL - num;
	do
	{
		printf("请输入要排查的坐标:");
		scanf("%d %d", &x, &y);
		//判断坐标合法性
		if (x >= 1 && x <= r && y >= 1 && y <= c)
		{
			if (show[x][y] == '*')
			{
				if (mine[x][y] == '1')
				{
					printf("很遗憾,你被炸死了\n");
					printf("布雷情况如下:\n");
					DisplayBoard(mine, ROW, COL);
					break;
				}
				else
				{
					last = UnfoldMine(show, mine, ROW, COL, x, y, last);
					DisplayBoard(show, ROW, COL);
				}
			}
			else
			{
				printf("该坐标已排查,请重新输入\n");
			}
		}
		else
		{
			printf("坐标错误,请重新输入\n");
		}
	} while (last);
	if (last == 0)
	{
		printf("恭喜你,排雷成功!\n");
	}
}

void game()
{
	char mine[ROWS][COLS] = { 0 };
	char show[ROWS][COLS] = { 0 };

	//初始化棋盘
	InitBoard(mine, ROWS, COLS, '0');
	InitBoard(show, ROWS, COLS, '*');

	//展示棋盘
	//DisplayBoard(mine, ROW, COL);
	DisplayBoard(show, ROW, COL);

	//布置雷
	SetMine(mine, ROW, COL, EASY_NUM);

	//寻找雷
	FindMine(mine, show, ROW, COL, EASY_NUM);

}

void menu()
{
	printf("*********************\n");
	printf("*****  1. PLAY  *****\n");
	printf("*****  0. EXIT  *****\n");
	printf("*********************\n");
}

int main()
{
	printf("****   扫雷游戏   ****\n");
	srand((unsigned int)time(NULL));
	int input = 0;
	do {
		menu();
		printf("请选择:");
		scanf("%d", &input);
		switch (input)
		{
		case 1:
			game();
			break;
		case 0:
			printf("退出游戏\n");
			break;
		default:
			printf("选择错误,请重新选择!\n");
		}
	} while (input);

	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值