36.有效的数独Java

36.有效的数独Java

题目描述

请你判断一个 9x9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
数独部分空格内已填入了数字，空白格用 ‘.’ 表示

输入输出样式

示例1：

输入：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”]]
输出：true

示例2：
输入：board =
[[“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

本题来自LeetCode：https://leetcode-cn.com/problems/valid-sudoku/

思路

利用HashSet只能存放不同的元素的特点，借此判别0-9的元素没有重复出现。首先双重循环遍历，分别把行、列的元素add到set1,set2中，如果add返回false则说明重复元素出现则直接返回false。然后再遍历9个子数独模块，add到set3中。

算法分析

时间复杂度O(n），空间复杂度为O(1)

求解函数

public boolean isValidSudoku(char[][] board) {
		//分别对应行、列、子数独块
        HashSet set1 = new HashSet();
        HashSet set2 = new HashSet();
        HashSet set3 = new HashSet();
        // 判断每一行，每一列
        for (int i = 0; i < 9; ++i) {
            for (int j = 0; j < 9; ++j) {
                if (board[i][j] != '.') {
                	//如果add返回false则说明重复元素出现
                    if (!set1.add(board[i][j])) {
                        return false;
                    }
                }
                if (board[j][i] != '.') {
                    if (!set2.add(board[j][i])) {
                        return false;
                    }
                }
            }
            //每一行/一列add完毕要清空set便于下次的操作
            set1.clear();
            set2.clear();
        }
        // 判断3X3的子矩阵
        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
            	//两重0-3的循坏代表3*3个子数独块
                for (int m = 3 * i; m < 3 * i + 3; ++m) {
                    for (int n = 3 * j; n < 3 * j + 3; ++n) {
                    	//每个子数独块的add
                        if (board[m][n] != '.') {
                            if (!set3.add(board[m][n])) {
                                return false;
                            }
                        }
                    }
                }
                set3.clear();
            }
        }
        return true;
    }