[LeetCode]Valid Sudoku

题目描述

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.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

判断一个数独的初始状态是否合法。

解题思路

Sudoku规则，在一个9*9的区域内：

• 每行1-9出现且只出现一次；
• 每列1-9出现且只出现一次；
• 在9个子3*3的区域内1-9出现且只出现一次。

因此，只需按上述规则判定每个有数字的格子是否合法即可。

代码

    public boolean isValidSudoku(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)) {
						return false;
					}

				}
			}
		}
		return true;
    }
    
    public  boolean isValid(char[][] board, int row, int column) {
		int cellStartX = (row / 3) * 3;
		int cellStartY = (column / 3) * 3;
		char c = board[row][column];

		for (int i = 0; i < board.length; i++) {
			if (i != row && board[i][column] == c) {
				return false;
			}
		}

		for (int i = 0; i < board[0].length; i++) {
			if (i != column && board[row][i] == c) {
				return false;
			}
		}

		for (int i = cellStartX; i < cellStartX + 3; i++) {
			for (int j = cellStartY; j < cellStartY + 3; j++) {
				if (i != row && j != column && board[i][j] == c)
					return false;
			}
		}

		return true;
	}