36. Valid Sudoku

最新推荐文章于 2024-09-18 18:23:55 发布

孤独的根号13

最新推荐文章于 2024-09-18 18:23:55 发布

阅读量249

点赞数

分类专栏： leetcode c++ 文章标签： leetcode hashtable

本文链接：https://blog.csdn.net/u010005161/article/details/51541128

版权

leetcode 同时被 2 个专栏收录

146 篇文章 0 订阅

订阅专栏

c++

113 篇文章 0 订阅

订阅专栏

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 '.'.

A partially filled sudoku which is valid.

Note:

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

1.我的答案

class Solution {
public:
    bool check(vector<bool>& v, int num){
    if(v[num])
    return true;
    v[num] = true;
    return false;
}

bool isValidSudoku(vector<vector<char>>& board) {
    //开3个辟辅助空间
    vector<bool> rownum(10,false);
    vector<vector<bool>> colnum(9, vector<bool>(10,false));
    vector<vector<bool>> cellnum(9, vector<bool>(10,false));
    for(int i = 0; i < 9; i++){
        vector<bool>rownum(9,false);
        for(int j = 0; j < 9; j++){
            if(board[i][j] == '.')
            continue;
            bool b1 = check(rownum, board[i][j]-'0');
            bool b2 = check(colnum[j], board[i][j]-'0');
            bool b3 = check(cellnum[(i/3)*3+j/3], board[i][j]-'0');
            if(b1 || b2 || b3)
            return false;
        }
    }
    return true;
}
};

2.别人的答案用位

bool isValidSudoku(vector<vector<char>>& board) {
    vector<short> col(9, 0);
    vector<short> block(9, 0);
    vector<short> row(9, 0);
    for (int i = 0; i < 9; i++)
     for (int j = 0; j < 9; j++) {
         if (board[i][j] != '.') {
             int idx = 1 << (board[i][j] - '0');
             if (row[i] & idx || col[j] & idx || block[i/3 * 3 + j / 3] & idx)
                return false;
            row[i] |= idx;
            col[j] |= idx;
            block[i/3 * 3 + j/3] |= idx;
         }
     }
     return true;
  }