习题：有效的数独（C语言）

题目

请你判断一个 9x9 的数独是否有效。
只需要 根据以下规则 ，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
数独部分空格内已填入了数字，空白格用 ‘.’ 表示。

注意：

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。

示例 1：

输入：board =
[[“5”,“3”,".",".",“7”,".",".",".","."]
,[“6”,".",".",“1”,“9”,“5”,".",".","."]
,[".",“9”,“8”,".",".",".",".",“6”,"."]
,[“8”,".",".",".",“6”,".",".",".",“3”]
,[“4”,".",".",“8”,".",“3”,".",".",“1”]
,[“7”,".",".",".",“2”,".",".",".",“6”]
,[".",“6”,".",".",".",".",“2”,“8”,"."]
,[".",".",".",“4”,“1”,“9”,".",".",“5”]
,[".",".",".",".",“8”,".",".",“7”,“9”]]
输出：true

示例 2：

输入：board =
[[“8”,“3”,".",".",“7”,".",".",".","."]
,[“6”,".",".",“1”,“9”,“5”,".",".","."]
,[".",“9”,“8”,".",".",".",".",“6”,"."]
,[“8”,".",".",".",“6”,".",".",".",“3”]
,[“4”,".",".",“8”,".",“3”,".",".",“1”]
,[“7”,".",".",".",“2”,".",".",".",“6”]
,[".",“6”,".",".",".",".",“2”,“8”,"."]
,[".",".",".",“4”,“1”,“9”,".",".",“5”]
,[".",".",".",".",“8”,".",".",“7”,“9”]]
输出：false
解释：除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

提示：

board.length == 9

board[i].length == 9

board[i][j] 是一位数字或者 ‘.’

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/valid-sudoku

暴力解法， 题解来源于评论区，链接在代码下方

bool isValidSudoku(char** board, int boardSize, int* boardColSize)
{
	for (int i = 0; i < boardSize; i++)//行数
	{
		for (int j = 0; j < *boardColSize; j++)//列数
		{
			if (board[i][j] != '.')
			{
				for (int k = 0; k < *boardColSize; k++)
				{
					if (j != k && board[i][j] == board[i][k])//查找每一行的情况	
						return false;
				}
				for (int k = 0; k < boardSize; k++)
				{
					if (i != k && board[i][j] == board[k][j])//查找每一列的情况
					{
						return false;
					}
				}
				//查找每个子块
				int x = i / 3 * 3;//每个字块中的x开端
				int y = j / 3 * 3;
				for (int m = 0; m < 3; m++)
				{
					for (int n = 0; n < 3; n++)
					{
						if (x + m != i && y + n != j && board[x + m][y + n] == board[i][j])//**
							return false;
					}
				}
			}
		}
	}
	return true;
}

作者：qsu-tong-v
链接：https://leetcode-cn.com/problems/valid-sudoku/solution/chun-cjian-dan-bao-li-wu-tao-lu-by-qsu-t-hecp/
来源：力扣（LeetCode）