【LeetCode 36】 Valid Sudoku

题目描述

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

思路

开始理解错了3x3的意思，按照题意，只有9个3x3方块，每个方块设置唯一坐标。
对行、列、方块标记1~9的数字。

代码

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int n = board.size();
        int m = board[0].size();
        vector<vector<bool> > row_mp(9, vector<bool>(9, false));
        vector<vector<bool> > col_mp(9, vector<bool>(9, false));
        vector<vector<bool> > cub_mp(9, vector<bool>(9, false));
        
        for (int i=0; i<9; ++i) {
            for (int j=0; j<9; ++j) {
                if (board[i][j] >= '1' && board[i][j] <= '9') {
                    int cur = board[i][j] - '1';
                    if (row_mp[i][cur] || col_mp[j][cur] || cub_mp[3*(i/3)+j/3][cur]) return false;
                    row_mp[i][cur] = true;
                    col_mp[j][cur] = true;
                    cub_mp[3*(i/3)+j/3][cur] = true;
                }
            }
        }
        
        return true;
    }
};