Day23 有效的数独

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

leetcode-cn.com/problems/va…

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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 形式的。

Java解法

思路：

• 就是按照规则来匹中是否有重复
• 第一步：规则数据集合
• 第二步：查重验证 算法正确，效率不高

官方解

leetcode-cn.com/problems/va…

1. 一次迭代

   遍历数组 确认数值是否违反规则

   class Solution {
     public boolean isValidSudoku(char[][] board) {
       // init data
       HashMap<Integer, Integer> [] rows = new HashMap[9];
       HashMap<Integer, Integer> [] columns = new HashMap[9];
       HashMap<Integer, Integer> [] boxes = new HashMap[9];
       for (int i = 0; i < 9; i++) {
         rows[i] = new HashMap<Integer, Integer>();
         columns[i] = new HashMap<Integer, Integer>();
         boxes[i] = new HashMap<Integer, Integer>();
       }
   
       // validate a board
       for (int i = 0; i < 9; i++) {
         for (int j = 0; j < 9; j++) {
           char num = board[i][j];
           if (num != '.') {
             int n = (int)num;
             int box_index = (i / 3 ) * 3 + j / 3;
   
             // keep the current cell value
             rows[i].put(n, rows[i].getOrDefault(n, 0) + 1);
             columns[j].put(n, columns[j].getOrDefault(n, 0) + 1);
             boxes[box_index].put(n, boxes[box_index].getOrDefault(n, 0) + 1);
   
             // check if this value has been already seen before
             if (rows[i].get(n) > 1 || columns[j].get(n) > 1 || boxes[box_index].get(n) > 1)
               return false;
           }
         }
       }
   
       return true;
     }
   }
   

   • 时间复杂度：O(1)

   • 空间复杂度：O(1)