LeetCode - 解题笔记 - 36 - Valid Sudoku

最新推荐文章于 2024-03-02 13:35:00 发布

支锦铭

最新推荐文章于 2024-03-02 13:35:00 发布

阅读量110

点赞数

分类专栏： LeetCode解题笔记文章标签： leetcode

本文链接：https://blog.csdn.net/cary_leo/article/details/114821892

版权

LeetCode解题笔记专栏收录该内容

191 篇文章 1 订阅

订阅专栏

Valid Sudoku

Solution 1

模拟题，没啥难度，就按照规则去判断就好了，以及官网题解写的那么复杂实际上没有优化很多，还不如平铺直叙地写，可读性相对更高一些。

时间复杂度： $O (1)$ ，因为三遍遍历的个数是常数
空间复杂度： $O (1)$ ，对应地，需要构建的数据结构的占用都是常数

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        unordered_map<char, int> check;
        unordered_map<char, int>::iterator it;
        
        // 所有的行
        for (int i = 0; i < board.size(); ++i) {
            check.clear();
            for (auto c: board[i]) {
                if (c != '.') {
                    if((it = check.find(c)) == check.end()){
                        check[c]++;
                    }
                    else {
                        return false;
                    }
                }
            }
            // cout << "ROW " << i << " Checked" << endl;
        }
        
        // 所有的列
        for (int i = 0; i < board.size(); ++i) {
            check.clear();
            for (int j = 0; j < board[0].size(); ++j) {
                char c = board[j][i];
                if (c != '.') {
                    if((it = check.find(c)) == check.end()){
                        check[c]++;
                    }
                    else {
                        return false;
                    }
                }
            }
            // cout << "COL " << i << " Checked" << endl;
        }
        
        // 所有的box
        vector<int> posRow = {0, 0, 0, 3, 3, 3, 6, 6, 6};
        vector<int> posCol = {0, 3, 6, 0, 3, 6, 0, 3, 6};
        vector<int> offsetRow = {0, 0, 0, 1, 1, 1, 2, 2, 2};
        vector<int> offsetCol = {0, 1, 2, 0, 1, 2, 0, 1, 2};
        
        for (int i = 0; i < board.size(); ++i) {
            check.clear();
            for (int j = 0; j < board[0].size(); ++j) {
                char c = board[posRow[i] + offsetRow[j]][posCol[i] + offsetCol[j]];
                if (c != '.') {
                    if((it = check.find(c)) == check.end()){
                        check[c]++;
                    }
                    else {
                        return false;
                    }
                }
            }
            // cout << "BOX " << i << " Checked" << endl;
        }
        
        
        return true;
        
    }
};

Solution 2

Solution 1的Python实现

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        check = list()
        
        for i in range(len(board)):
            check.clear()
            for c in board[i]:
                if c != '.':
                    if c not in check: check.append(c)
                    else: return False
            # print("ROW", i, "Checked")
            
        for i in range(len(board)):
            check.clear()
            for j in range(len(board[i])):
                c = board[j][i]
                if c != '.':
                    if c not in check: check.append(c)
                    else: return False
            # print("COL", i, "Checked")
            
        posRow = [0, 0, 0, 3, 3, 3, 6, 6, 6];
        posCol = [0, 3, 6, 0, 3, 6, 0, 3, 6];
        offsetRow = [0, 0, 0, 1, 1, 1, 2, 2, 2];
        offsetCol = [0, 1, 2, 0, 1, 2, 0, 1, 2];
        for i in range(len(board)):
            check.clear()
            for j in range(len(board[i])):
                c = board[posRow[i] + offsetRow[j]][posCol[i] + offsetCol[j]]
                if c != '.':
                    if c not in check: check.append(c)
                    else: return False
            # print("BOX", i, "Checked")
                
                
        return True