题解 | #暮光数独验证#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param board char字符型vector<vector<>> 
     * @return bool布尔型
     */
    bool isValidTwilightSudoku(vector<vector<char> >& board) {
        // write code here
        unordered_set<string> seen;
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                char num = board[i][j];
                if (num != '.') {
                    string row = "row" + to_string(i) + num;
                    string col = "col" + to_string(j) + num;
                    string box = "box" + to_string(i/3) + to_string(j/3) + num;
                    if (seen.count(row) || seen.count(col) || seen.count(box)) {
                        return false;
                    }
                    seen.insert(row);
                    seen.insert(col);
                    seen.insert(box);
                }
            }
        }
        return true;
    }
};