leetcode 36. 有效的数独 medium

leetcode 36. 有效的数独   medium          

题目描述：

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

数独部分空格内已填入了数字，空白格用 '.' 表示。

示例 1:

输入:
[
  ["5","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
输出: true

解题思路：

遍历矩阵，验证每一个位置的数字，它在该行，该列，该子矩阵中是不是之前没出现过。

其实最巧妙的是把当前的行和列坐标转为子矩阵编号 box_index = (row / 3) * 3 + columns / 3，其中 / 是整数除法。

代码：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        
        vector<vector<bool>> rowflag(9,vector<bool>(9,false));
        vector<vector<bool>> colflag(9,vector<bool>(9,false));
        vector<vector<bool>> cellflag(9,vector<bool>(9,false));
        

        
        for(int i=0;i<9;++i)
            for(int j=0;j<9;++j){
                if(board[i][j]=='.') continue;
                
                int cur=board[i][j]-'1'; // 转为数字
                
                // 最关键的一步，把当前坐标转为子矩阵编号
                // box_index = (row / 3) * 3 + columns / 3
                if(rowflag[i][cur] || colflag[j][cur] || cellflag[(i/3)*3+j/3][cur])
                    return false;
                rowflag[i][cur]=colflag[j][cur]=cellflag[(i/3)*3+j/3][cur]=true;
            }
        return true;
        
    }
};