HashTable-36-Valid Sudoku

最新推荐文章于 2024-09-20 15:09:03 发布

kevin聪

最新推荐文章于 2024-09-20 15:09:03 发布

阅读量250

点赞数

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/79154944

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

Description:
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 ‘.’.

这里写图片描述

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

Best Solution:

class Solution {
    public boolean isValidSudoku(char[][] board) {
        if (board == null || board.length != 9 || board[0].length != 9) {
            return false;    
        }
        boolean[][] rowValids = new boolean[9][9];    
        boolean[][] columnValids = new boolean[9][9];
        boolean[][] subBoxValids = new boolean[9][9];
        for (int i = 0; i < board.length; ++i) {
            for (int j = 0; j < board[0].length; ++j) {
                if (board[i][j] != '.') {
                    int num = board[i][j] - '0' - 1;
                    //注意这里的转换
                    int k = i / 3 * 3 + j / 3;
                    if (rowValids[i][num] || columnValids[j][num] || subBoxValids[k][num]) {
                        return false;   
                    }
                    rowValids[i][num] = columnValids[j][num] = subBoxValids[k][num] = true;
                }
            }
        }
        return true;
    }
}