[Leetcode] Valid Sudoku (Java)

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.

A partially filled sudoku which is valid.

判断目前数独状态是否正常（不是判断是否有解，害我想了好久）

public class ValidSudoku {
	public boolean isValidSudoku(char[][] board) {
		boolean flag = true;
		for(int i = 0;i<9;i++){
			flag = checkRow(board[i]);
			if(!flag)
				return false;
		}
		for(int i=0;i<9;i++){
			char[] chars = new char[9];
			for(int j=0;j<9;j++)
				chars[j]=board[j][i];
			flag = checkRow(chars);
			if(!flag)
				return false;
		}
		
		for(int i=0;i<3;i++){
			for(int j=0;j<3;j++){
				char[] chars = new char[9];
				for(int k=0;k<9;k++){
					chars[k]=board[3*i+k/3][3*j+k%3];
				}
				flag = checkRow(chars);
				if(!flag)
					return false;
			}
		}
		return flag;
	}
	private boolean checkRow(char[] chars) {
		boolean[] used = new boolean[9];
		for(char c :chars){
			if(c=='.')
				continue;
			else {
				if(used[c-'1'])
					return false;
				used[c-'1']=true;
			}
		}
		return true;
	}
	public static void main(String[] args) {
		char[][] board={
				{'.','.','4','.','.','.','6','3','.'},
				{'.','.','.','.','.','.','.','.','.'},
				{'5','.','.','.','.','.','.','9','.'},
				{'.','.','.','5','6','.','.','.','.'},
				{'4','.','3','.','.','.','.','.','1'},
				{'.','.','.','7','.','.','.','.','.'},
				{'.','.','.','5','.','.','.','.','.'},
				{'.','.','.','.','.','.','.','.','.'},
				{'.','.','.','.','.','.','.','.','.'},
		};
		System.out.println(new ValidSudoku().isValidSudoku(board));
	}
}