LeetCode-Valid Sudoku

最新推荐文章于 2022-03-18 15:45:17 发布

BeHelium

最新推荐文章于 2022-03-18 15:45:17 发布

阅读量152

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode Java

本文链接：https://blog.youkuaiyun.com/qq_24133491/article/details/81238916

LeetCode 专栏收录该内容

306 篇文章

订阅专栏

本文介绍了一个简单有效的算法来验证一个9x9数独板的有效性。该算法通过检查每行、每列及每个3x3子网格内的数字是否重复来确保数独遵循基本规则。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description:
Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

A partially filled sudoku which is valid.

The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.

Example 1:

Input:
[
  ["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"]
]
Output: true

Example 2:

Input:
[
  ["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"]
]
Output: false

Explanation: Same as Example 1, except with the 5 in the top left corner being
modified to 8. Since there are two 8’s in the top left 3x3 sub-box, it is invalid.

题意：验证给定的一个九宫格板上已填的数字是否符合既定的规则；

解法：最简单的办法就是按照给定的规则判断每一行、每一列和每个小九宫格是否数字重复；

class Solution {
    public boolean isValidSudoku(char[][] board) {
        for(int i=0; i<9; i++){
            char[] digits = new char[] {'1','2','3','4','5','6','7','8','9'};
            for(int j=0; j<9; j++){
                if(board[i][j] == '.') continue;
                if(digits[board[i][j] - '1'] != '.') digits[board[i][j] - '1'] = '.';
                else return false;
            }
        }//checking each row
        for(int i=0; i<9; i++){
            char[] digits = new char[] {'1','2','3','4','5','6','7','8','9'};
            for(int j=0; j<9; j++){
                if(board[j][i] == '.') continue;
                if(digits[board[j][i] - '1'] != '.') digits[board[j][i] - '1'] = '.';
                else return false;
            }
        }//checking each column
        for(int k=0; k<9; k++){
            int rowSt = k/3*3;
            int rowEd = rowSt + 3;
            int colSt = k%3*3;
            int colEd = colSt + 3;
            char[] digits = new char[] {'1','2','3','4','5','6','7','8','9'};
            for(int i=rowSt; i<rowEd; i++){
                for(int j=colSt; j<colEd; j++){
                    if(board[i][j] == '.') continue;
                    if(digits[board[i][j] - '1'] != '.') digits[board[i][j] - '1'] = '.';
                    else return false;
                }
            }
        }//checking each sub-boxes
        return true;
    }
}