图valid-sudoku-leetcode练习题

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

/**
 * 判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。
 * <p>
 * 数字 1-9 在每一行只能出现一次。
 * 数字 1-9 在每一列只能出现一次。
 * 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
 * <p>
 * 数独部分空格内已填入了数字，空白格用 '.' 表示。
 * <p>
 * 示例 1:
 * <p>
 * 输入:
 * [
 * ["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"]
 * ]
 * 输出: true
 * 示例 2:
 * <p>
 * 输入:
 * [
 *   ["8","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"]
 * ]
 * 输出: false
 * 解释: 除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。
 * 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
 * 说明:
 * <p>
 * 一个有效的数独（部分已被填充）不一定是可解的。
 * 只需要根据以上规则，验证已经填入的数字是否有效即可。
 * 给定数独序列只包含数字 1-9 和字符 '.' 。
 * 给定数独永远是 9x9 形式的。
 * <p>
 * 来源：力扣（LeetCode）
 * 链接：https://leetcode-cn.com/problems/valid-sudoku
 * 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 */
public class Solution {
    public boolean isValidSudoku(char[][] board) {
        List<HashMap<Integer, Integer>> rowMap = new ArrayList<>();
        List<HashMap<Integer, Integer>> colMap = new ArrayList<>();
        List<HashMap<Integer, Integer>> squareMap = new ArrayList<>();
        // 初始化
        for (int i = 0; i < board.length; i++) {
            rowMap.add(new HashMap<>(9));
            colMap.add(new HashMap<>(9));
            squareMap.add(new HashMap<>(9));
        }
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[i].length; j++) {
                char currentChar = board[i][j];
                if (currentChar != '.') {
                    int currentNumber = currentChar - '0';
                    // 行
                    HashMap<Integer, Integer> currentRow = rowMap.get(i);
                    currentRow.put(currentNumber, currentRow.getOrDefault(currentNumber, 0) + 1);
                    // 列
                    HashMap<Integer, Integer> currentCol = colMap.get(j);
                    currentCol.put(currentNumber, currentCol.getOrDefault(currentNumber, 0) + 1);
                    // 方格子
                    int squareIndex = (i / 3) * 3 + j / 3;
                    HashMap<Integer, Integer> currentSquare = squareMap.get(squareIndex);
                    currentSquare.put(currentNumber, currentSquare.getOrDefault(currentNumber, 0) + 1);
                    // 判断异常情况
                    if (currentRow.get(currentNumber) > 1 || currentCol.get(currentNumber) > 1 || currentSquare.get(currentNumber) > 1) {
                        return false;
                    }
                }
            }
        }
        return true;
    }

    public static void main(String[] args) {
        char[][] board = {
                {'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'}};
        Solution solution = new Solution();
        System.out.println(solution.isValidSudoku(board));
    }
}

 

思想：

int squareIndex = (i / 3) * 3 + j / 3;