LeetCode——Valid Sudoku

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:
Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

A partially filled sudoku which is valid.
The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.

• Example 1:
  Input:
  [
  [“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”]
  ]
  Output: true
• Example 2:
  Input:
  [
  [“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”]
  ]
  Output: false
  Explanation: Same as Example 1, except with the 5 in the top left corner being
  modified to 8. Since there are two 8’s in the top left 3x3 sub-box, it is invalid.
• Note:
  A Sudoku board (partially filled) could be valid but is not necessarily solvable.
  Only the filled cells need to be validated according to the mentioned rules.
  The given board contain only digits 1-9 and the character ‘.’.
  The given board size is always 9x9.

解法一

定义三个二维数组 rows[i][j]表示第i行是否存在j这个数字，cols[i][j]表示第i列是否存在j这个数字，cells[i][j]表示第i个小方格里是否存在j这个数字。

public boolean isValidSudoku(char[][] board) {
		int n=board.length;
		int m=board[0].length;
        boolean[][] rows=new boolean[n][10];
        boolean[][] cols=new boolean[m][10];
        boolean[][] cells=new boolean[m*n/9][10];
		for(int i=0;i<9;i++)
        	for(int j=0;j<9;j++)
        	{
        		char c=board[i][j];
        		if(c>='1'&&c<='9')
        		{
        			int cc=c-'0';
	        		if(rows[i][cc]||cols[j][cc]||cells[3*(i/3)+j/3][cc])
	        			return false;
	        		rows[i][cc]=true;
	        		cols[j][cc]=true;
	        		cells[3*(i/3)+j/3][cc]=true;
        		}
        	}

Runtime: 12 ms, faster than 98.93% of Java online submissions for Valid Sudoku.
Memory Usage: 45.5 MB, less than 66.34% of Java online submissions for Valid Sudoku.

解法二

leetcode上看到了一种很巧妙地做法，用三个数组。vset[i]中的第j位数字为1表示第i行有j这个数字，其他数组同理

public boolean isValidSudoku1(char[][] board) {
		int [] vset=new int[9];
		int[] hset=new int[9];
		int[] cells=new int[9];
		for(int i=0;i<9;i++){
			for(int j=0;j<9;j++){
				if(board[i][j]!='.')
				{
					int c=1<<(board[i][j]-'0');
					if((hset[i]&c)>0||(vset[j]&c)>0||(cells[3*(i/3)+j/3]&c)>0)
						return false;
					hset[i]|=c;
					vset[j]|=c;
					cells[3*(i/3)+j/3]|=c;
				}
			}
		}
		return true;
	}

Runtime: 13 ms, faster than 93.16% of Java online submissions for Valid Sudoku.
Memory Usage: 46.1 MB, less than 47.27% of Java online submissions for Valid Sudoku.