36. 有效的数独

class Solution {
    public boolean isValidSudoku(char[][] board) {
        return solve(board);
    }

    public boolean solve(char[][] board) {
        for (int i = 0; i < board.length; i++) for (int j = 0; j < board[0].length; j++) {
            if (board[i][j] != '.') {
                if(!isValid(board, i, j, board[i][j]))
                    return false;
            }
        }
        return true;
    }

    public boolean isValid(char[][] board, int i, int j, char c) {
        for (int k = 0; k < 9; k++) {
            if (k != j &&board[i][k] == c) {
                return false;
            }
            if (k != i && board[k][j] == c) {
                return false;
            }
            if (!((3 * (i / 3) + k % 3) == i && (3 * (j / 3) + k / 3) == j) && board[3 * (i / 3) + k % 3][3 * (j / 3) + k / 3] == c) {
                return false;
            }
        }
        return true;
    }
}

注：

1. 一个个点去判断是否满足条件就可以了。主要难点在于如何表示3*3的矩阵。

board[3 * (i / 3) + k % 3][3 * (j / 3) + k / 3]

这一行比较tricky