【LeetCode】有效的数独

系列文章目录

---

---

前言

---

一、有效的数独

判断一个 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 形式的。

相关标签
哈希表

作者：力扣 (LeetCode)
链接：https://leetcode-cn.com/leetbook/read/top-interview-questions-easy/x2f9gg/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

二、使用步骤

代码如下：

用数组做记录 数据量小用桶方法

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
    int row[9][9]={0};
    int column[9][9]={0};
    int box[9][9]={0};
	for (int i = 0; i < 9; i++)
	{
		for (int j = 0; j < 9; j++)
		{
			int box_index = i / 3 * 3 + j / 3;
			int temp = board[i][j]-'0'-1;
            if(temp=='.'-'0'-1) continue;
			if (row[i][temp]==1 || column[j][temp]==1 || box[box_index][temp]==1) return false;
			++row[i][temp];
			++column[j][temp];
			++box[box_index][temp];
		}

	}
    return true;
    }
};

作者：duyanshu
链接：https://leetcode-cn.com/leetbook/read/top-interview-questions-easy/x2f9gg/?discussion=YZKhCK
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

位运算判断是否重复

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
		int row[9]={0};
		int line[9]={0};
		int box [9]={0};
        int i,j,index;
		for (i = 0; i < 9; i++) {
			for ( j = 0; j < 9; j++) {
				if(board[i][j] == '.'){
					continue;
				}
				index =1<< (board[i][j] -'0'-1);
                if(row[i]&index||line[j]&index||box[(i/3)*3+j/3]&index) return false;
                row[i]|=index;
                line[j]|=index;
                box[(i/3)*3+j/3]|=index;
            }
        }
        return true;

    }
};

作者：salt_emperor
链接：https://leetcode-cn.com/leetbook/read/top-interview-questions-easy/x2f9gg/?discussion=fEk6qS
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

---

总结

以上就是今天要讲的内容