LeetCode36-有效的数独

LeetCode36-有效的数独

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

数独部分空格内已填入了数字，空白格用 ‘.’ 表示。

示例 1:

输入:
[
  ["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:

输入:
[
  ["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 存在, 因此这个数独是无效的。

说明:

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 ‘.’ 。
给定数独永远是 9x9 形式的。

一、思路

暂时没有想出好的算法，先试试暴力解法：

（一）暴力解法

算法流程：
（1）遍历每一行，看看是否有重复的数
（2）遍历每一列，看看是否有重复的数
（3）遍历每一个小的3*3宫，看看是否有重复的数

实际上，可以使用空间换时间，在遍历每一行的时候，就把这些数据都存储下来，使用集合来筛去重复的数字，这样即可实现判重

C++代码：

class Solution {
public:
	bool isValidSudoku(vector<vector<char>>& board) {
		int i, j;
		char c;
		vector<set<char>> nums_row(9), nums_col(9), nums_33(9);
		vector<int> count_row(9, 0), count_col(9, 0), count_33(9, 0);
		map<int, int> hash_i, hash_j;
		
		// 建立哈希表，方便查找下标
		for (i = 0; i < 9; i++) {
			if (i < 3) {
				hash_i.insert(map<int, int>::value_type(i, 0));
				hash_j.insert(map<int, int>::value_type(i, 0));
			}
			else if (i < 6) {
				hash_i.insert(map<int, int>::value_type(i, 3));
				hash_j.insert(map<int, int>::value_type(i, 1));
			}
			else {
				hash_i.insert(map<int, int>::value_type(i, 6));
				hash_j.insert(map<int, int>::value_type(i, 2));
			}	
		}
		
		// 开始进行逐行判重
		for (i = 0; i < 9; i++) {
			for (j = 0; j < 9; j++) {
				c = board[i][j];
				if (c >= '1'&&c <= '9') {
					count_row[i]++;
					nums_row[i].insert(c);
					if (count_row[i] != nums_row[i].size())
						return false;

					count_col[j]++;
					nums_col[j].insert(c);
					if (count_col[j] != nums_col[j].size())
						return false;

					count_33[hash_i[i] + hash_j[j]]++;
					nums_33[hash_i[i] + hash_j[j]].insert(c);
					if (count_33[hash_i[i] + hash_j[j]] != nums_33[hash_i[i] + hash_j[j]].size())
						return false;
				}
			}
		}
		return true;
	}
};

执行效率：