现在的位置: 首页 > 综合 > 正文

LeetCode题解:Valid Sudoku

2018年03月31日 ⁄ 综合 ⁄ 共 808字 ⁄ 字号 评论关闭

Valid Sudoku

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.

思路:

遍历整个棋盘,记录每一行,每一列,每一块用过的数字。一旦发现一个数字在行,列,块上有重复则报错。

题解:

// ⑨者,笨蛋也
#define BAKA 9

class Solution {
public:
    bool isValidSudoku(vector<vector<char> > &board) {
        array<bool, BAKA> row[BAKA];
        array<bool, BAKA> col[BAKA];
        array<bool, BAKA> box[BAKA];

        // as standard C array
        // the variables are not initialized...
        for(auto r = 0; r < BAKA; ++r)
            for(auto c = 0; c < BAKA; ++c)
                row[r][c] = col[r][c] = box[r][c] = false;

        for(auto r = 0; r < BAKA; ++r)
            for(auto c = 0; c < BAKA; ++c)
            {
                char ch=board[r][c];
                if (ch == '.')
                    continue;   // blank, no effect
                
                ch -= '1';
                
                if (row[r][ch])
                    return false;
                row[r][ch] = true;
                
                if (col[c][ch])
                    return false;
                col[c][ch] = true;
                
                if (box[r / 3 * 3 + c / 3][ch])
                    return false;
                box[r / 3 * 3 + c / 3][ch] = true;
            }
            
        return true;
    }
};

抱歉!评论已关闭.