关闭

36. Valid Sudoku

标签: leetcodehashtable
135人阅读 评论(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;
  }


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:35486次
    • 积分:1975
    • 等级:
    • 排名:千里之外
    • 原创:171篇
    • 转载:1篇
    • 译文:0篇
    • 评论:3条
    最新评论