解9*9 数独

/*
编写一个程序，通过填充空格来解决数独问题。

数独的解法需 遵循如下规则：

数字 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"]]
输出：[["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
解释：输入的数独如上图所示，唯一有效的解决方案如下所示：


 

提示：

board.length == 9
board[i].length == 9
board[i][j] 是一位数字或者 '.'
题目数据 保证 输入数独仅有一个解

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/sudoku-solver
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <stdint.h>


struct to_fill_info {
	int row, col;
};

void solveSudoku(char** board, int boardSize, int* boardColSize)
{
	char *in_put = (char *)board;
	struct to_fill_info to_fill[9 * 9];
	int sudoku[9][9], has_nums[10];
	int need_fill = 0, cnt = 0;
	int i, j;

	for (i = 0; i < 9; i++) {
		for (j = 0; j < 9; j++) {
			if (*(in_put + i * 9 + j) == '.') {
				sudoku[i][j] = 0;
				to_fill[need_fill].row = i;
				to_fill[need_fill].col = j;
				need_fill++;
			} else {
				sudoku[i][j] = *(in_put + i * 9 + j) - '0';
			}
		}
	}

	for (cnt = 0; cnt < need_fill; cnt++) {
		memset(has_nums, 0, sizeof(int) * 10);
		int row = to_fill[cnt].row;
		int col = to_fill[cnt].col;
		int rect_i = (row / 3) * 3;
		int rect_j = (col / 3) * 3;

		//get to_fill[cnt]  row and column all numbers
		for (i = 0; i < 9; i++) {
			has_nums[sudoku[row][i]] = 1;
			has_nums[sudoku[i][col]] = 1;
		}

		//get all rect or 3 * 3 numbers
		for (i = rect_i; i < (rect_i + 3); i++) {
			for (j = rect_j; j < (rect_j + 3); j++) {
				has_nums[sudoku[i][j]] = 1;
			}
		}

		for (i = sudoku[row][col] + 1; i < 10; i++) {
			if (has_nums[i] == 0) {
				sudoku[row][col] = i;
				break;
			}
		}
		//not found a unfilled num
		if (i == 10) {
			if (cnt == 0) //not filled succesfully
				break;
			
			// go back to last one to fill again.
			sudoku[row][col] = 0;
			cnt -= 2;
		}
	}

	//successful
	if (cnt == need_fill) {
		for (cnt = 0; cnt < need_fill; cnt++) {
			int row = to_fill[cnt].row;
			int col = to_fill[cnt].col;
			*(in_put + row * 9 + col) = sudoku[row][col] + '0';
		}
	}
}


int main(int argc, char *argv[])
{
	int i, j;

	char board[9][9] = {{'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'}};

	int boardColSize = 9;

	solveSudoku((char **)board, 9, &boardColSize);
	
	for (i = 0; i < 9; i++) {
		for (j = 0; j < 9; j++) {
			printf("%c ", board[i][j]);
		}
		printf("\n");
	}
	

	return 0;
}