LeetCode刷题day036 (Jieky)

LeetCode第36题 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.

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.
*/
import java.util.*;
public class ValidSudoku{
	public static void main(String[] args){
		char Sudoku[][] = {
		{'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'}};
		ValidSudoku vs = new ValidSudoku();
		boolean result = vs.isValidSudoku(Sudoku);
		System.out.println(result);
	}
	// 分析版本1可以发现，数据的归属有三种情况：行归属、列归属、方框归属。
	// 将元素加载到HashSet时，表示元素的归属，若有两个相同归属同一类，则不符合条件
	public boolean isValidSudoku(char[][] board) {
		Set<String> mySet = new HashSet<String>();
		for (int i=0;i<9;i++){
			for (int j=0;j<9;j++){
				if(board[i][j] != '.') {
					String elem = "("+board[i][j]+")";
					// 判断行是否重复
					if (!mySet.add(i+elem)) return false;
					// 判断列是否重复
					if (!mySet.add(elem+j)) return false;
					// 判断方格是否重复
					if (!mySet.add(i/3 + elem + j/3)) return false;
				}
			}
		}
		
		return true;
	}
}