lintcode-easy-Valid Sudoku

class Solution {
    /**
      * @param board: the board
        @return: wether the Sudoku is valid
      */
    public boolean isValidSudoku(char[][] board) {
        
        for(int i = 0; i < 9; i++){
                HashSet<Character> row = new HashSet<Character>();
                HashSet<Character> col = new HashSet<Character>();
                HashSet<Character> sqr = new HashSet<Character>();
                
            for(int j = 0; j < 9; j++){
                if(board[i][j] != ‘.‘){
                    if(!row.contains(board[i][j]))
                        row.add(board[i][j]);
                    else
                        return false;
                }
                
                if(board[j][i] != ‘.‘){
                    if(!col.contains(board[j][i]))
                        col.add(board[j][i]);
                    else
                        return false;
                }
                
                if(board[j % 3 + i % 3 * 3][j / 3 + i /3 * 3] != ‘.‘){
                    if(!sqr.contains(board[j % 3 + i % 3 * 3][j / 3 + i /3 * 3]))
                        sqr.add(board[j % 3 + i % 3 * 3][j / 3 + i /3 * 3]);
                    else
                        return false;
                }
                
            }
        }
        
        return true;
    }
};