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

import java.util.Set;
import java.util.HashSet;

/*
 * 计数位：当前位置前0的个数n
 * 数组依次向前n位
 * 余下补0
*/
class Solution {
	/*
	 * 第i个九宫格的第j个格点的行号可表示为3*(i/3)+j/3
	 * 列号可表示为3*(i%3)+j%3
	 * 迭代9次，每次利用三个HashSet存储需要判断的第i行，第i列，第i个九宫格中的非零元素
	 * O(3*rowNum*colNum)
	 * 结果
	 * 执行用时 : 12 ms
	 * 内存消耗 : 46.4 MB
	 */
	public static boolean isValidSudoku1(char[][] board) {
		for(int i=0;i<9;i++) {
			HashSet<Character> row=new HashSet<>();
			HashSet<Character> column=new HashSet<>();
			HashSet<Character> card=new HashSet<>();
			for(int j=0;j<9;j++) {
				//检查第i行，在横坐标位置
				if(board[i][j]!='.'&&!row.add(board[i][j]))
					return false;
				//检查第i列，在纵坐标位置
				if(board[j][i]!='.'&&!column.add(board[j][i]))
					return false;
				//行号+偏移量
				int RowIndex=3*(i/3)+j/3;
				int ColIndex=3*(i%3)+j%3;
				if(board[RowIndex][ColIndex]!='.'
					&& !card.add(board[RowIndex][ColIndex]))
					return false;
			}
			row.clear();
			column.clear();
			card.clear();
		}
		return true;
    }
	
	/*
	 * 第i个九宫格的第j个格点的行号可表示为3*(i/3)+j/3
	 * 列号可表示为3*(i%3)+j%3
	 * 迭代9次，每次利用三个HashSet存储需要判断的第i行，第i列，第i个九宫格中的非零元素
	 * O(3*rowNum*colNum)
	 * 相比3并行，且相比1会消除用过的HashSet，内存占用少
	 * 结果
	 * 执行用时 : 12 ms
	 * 内存消耗 : 39.2 MB
	 */
	public static boolean isValidSudoku2(char[][] board) {
		HashSet<Character> row=new HashSet<>();
		HashSet<Character> column=new HashSet<>();
		HashSet<Character> card=new HashSet<>();
		for(int i=0;i<9;i++) {
			for(int j=0;j<9;j++) {
				//检查第i行，在横坐标位置
				if(board[i][j]!='.'&&!row.add(board[i][j]))
					return false;
				//检查第i列，在纵坐标位置
				if(board[j][i]!='.'&&!column.add(board[j][i]))
					return false;
				//行号+偏移量
				int RowIndex=3*(i/3)+j/3;
				int ColIndex=3*(i%3)+j%3;
				if(board[RowIndex][ColIndex]!='.'
					&& !card.add(board[RowIndex][ColIndex]))
					return false;
			}
			row.clear();
			column.clear();
			card.clear();
		}
		return true;
    }
	
	/*
	 * 每次利用一个HashSet存储需要判断的九个元素中的非零元素，空间复杂度O(9)
	 * 先判断每一行，时间复杂度O(rowNum*9)
	 * 再判断每一列，时间复杂度O(colNum*9)
	 * 最后判断每个3*3的九宫格，时间复杂度O(cardNum*9)
	 * 执行用时 : 9 ms
	 * 内存消耗 : 45 MB
	 */
	public static boolean isValidSudoku3(char[][] board) {
		HashSet<Character> set=new HashSet<Character>();
		//判断每一行
		for(int i=0;i<9;i++) {
			for(int j=0;j<9;j++) {
				if(board[i][j]!='.') {
					if(!set.add(board[i][j]))
						return false;
				}
			}
			set.clear();
		}
		
		//判断每一列
		for(int i=0;i<9;i++) {
			for(int j=0;j<9;j++) {
				if(board[j][i]!='.') {
					if(!set.add(board[j][i]))
						return false;
				}
			}
			set.clear();
		}
		
		//判断每3*3个格子
		for(int i=0;i<9;i+=3) {
			for(int j=0;j<9;j+=3) {
				for(int pi=0;pi<3;pi++) {
					for(int pj=0;pj<3;pj++) {
						if(board[i+pi][j+pj]!='.')
							if(!set.add(board[i+pi][j+pj]))
								return false;
					}
				}
				set.clear();
			}
		}
		return true;

    }


    
    public static void main(String[] args) {
    	char[][] arr1 = {
    	                 {'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'}
    	};
    	char[][] arr2 = {
                {'.','.','.','.','5','.','.','1','.'},
                {'.','4','.','3','.','.','.','.','.'},
                {'.','.','.','.','.','3','.','.','1'},
                {'8','.','.','.','.','.','.','2','.'},
                {'.','.','2','.','7','.','.','.','.'},
                {'.','1','5','.','.','.','.','.','.'},
                {'.','.','.','.','.','2','.','.','.'},
                {'.','2','.','9','.','.','.','.','.'},
                {'.','.','4','.','.','.','.','.','.'}
    	};
    	boolean result=isValidSudoku1(arr1);
    	System.out.println(result);
    }
}