leetcode 有效的数独

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

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 形式的。

解题思路：

分析题意，有两个难点，

第一个难点，如何进行最小次数的遍历

一、最直接的方法，就是三次遍历数独的表，去检查行、列、子数独是否重复。

二、一次遍历，检查行、列、子数独是否重复。

第一种情况，不赘述，三次二重for循环即可。

第二种情况，一次循环，检查行和列的时候，只需要将数组下标反过来即可。主要是计算子数独，分析子数独的每个下标和依次循环时候i，j的下标的关系。

根据题意，for循环时，i和j的变化为：

i 的变化

0 0 0 0 0 0 0 0 0

1 1 1 1 1 1 1 1 1

2 2 2 2 2 2 2 2 2

3 3 3 3 3 3 3 3 3

4 4 4 4 4 4 4 4 4

5 5 5 5 5 5 5 5 5

6 6 6 6 6 6 6 6 6

7 7 7 7 7 7 7 7 7

8 8 8 8 8 8 8 8 8

j 的变化

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

0 1 2 3 4 5 6 7 8

而子数独从左到右，从上到下，第一个数独的下标为

00 01 02

10 11 12

20 21 22

第二个数独的下标为：

03 04 05

13 14 15

23 24 25

第四个数独的下标为：

30 31 32

40 41 42

50 51 52

这样对应起来，

i=0 0 0 0 0 0 0 0 0 和j=0 1 2 3 4 5 6 7 8 对应的是第一个数独，

i=3 3 3 3 3 3 3 3 3 和j=0 1 2 3 4 5 6 7 8 对应的是第四个数独，

所以数独的下标

x = 3*(i/3)+j/3

y = 3 *(i%3) +j%3

这样一次遍历，检查 board[i][j] ，board[j][i] 和board[x][y]，就可以把三种情况都考虑进来了。

第二个难点，如何检查是否有重复数据。

一，采用hashmap的方式，用value -> count的方式跟踪每个值出现的次数

二，位图法，取最大值max+1长度的数组来存放该值对应的状态，如果没有，将状态置为1，如果有，说明有重复，即返回false.

下面是采用位图法的代码：

class Solution {
    public boolean isValidSudoku(char[][] board) {
        

        for(int i =0;i<9;i++) {
        	int[] row = new int[9];
        	int[] col = new int[9];
        	int[] cube = new int[9];
        	for(int j=0;j<9;j++) {
//检查行
        		if(board[i][j]!='.') {
        			if(row[board[i][j]-'1']==1) {
        				return false;
        			}else {
        				row[board[i][j]-'1']=1;
        			}
        		}
//检查列
        		if(board[j][i]!='.') {
        		if(col[board[j][i]-'1']==1) {
    				return false;
    			}else {
    				col[board[j][i]-'1']=1;
    			}
                }
//检查子数独
        		
        		 int cubeX = 3 * (i/3) + j/3; 
        		 int cubeY = 3 * (i%3) + j%3; 
        		 if(board[cubeX][cubeY]!='.'){ 
        			 if (cube[board[cubeX][cubeY] - '1'] == 1){ 
        				 return false; 
        				 }else{ 
        					 cube[board[cubeX][cubeY] - '1'] = 1; 
        				}
        		 }
        		 
        		
        	}
        	
        
        }
        return true;
    
    }
}

下面是采用HashMap的代码：

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;
  }
}