c_cpp 36.有效的数独 - 难度中等 - 2018.9.18

Posted 2021-05-14

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        // 判断每一行是否有重复
        for (int i = 0; i < 9; i++) {
            vector<int> tVec(9, 0);
            for (int j = 0; j < 9; j++) {
                if (board[i][j] == '.') {
                    continue;
                }
                if (tVec[board[i][j] - '0'] == 1) {
                    return false;
                }
                tVec[board[i][j] - '0'] += 1;
            }
        }
        // 判断每一列是否有重复
        for (int i = 0; i < 9; i++) {
            vector<int> tVec(9, 0);
            for (int j = 0; j < 9; j++) {
                if (board[j][i] == '.') {
                    continue;
                }
                if (tVec[board[j][i] - '1'] == 1) {
                    return false;
                }
                tVec[board[j][i] - '1'] += 1;
            }
        }
        // 判断每一个3*3格子是否有重复
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                vector<int> tVec(9, 0);
                for (int z = 0; z < 9; z++) {
                    if (board[i*3 + z/3][j*3 + z%3] == '.') {
                        continue;
                    }
                    if (tVec[board[i*3 + z/3][j*3 + z%3] - '1'] == 1) {
                        return false;
                    }
                    tVec[board[i*3 + z/3][j*3 + z%3] - '1'] += 1;
                }
            }
        }
        return true;
    }
};