Leetcode 36. 有效的数独 C++

版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/Random_R/article/details/81139940

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

  1. 数字 1-9 在每一行只能出现一次。
  2. 数字 1-9 在每一列只能出现一次。
  3. 数字 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

示例 2:

输入:
[
  ["8","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"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。
     但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

说明:

  • 一个有效的数独(部分已被填充)不一定是可解的。
  • 只需要根据以上规则,验证已经填入的数字是否有效即可。
  • 给定数独序列只包含数字 1-9 和字符 '.' 。
  • 给定数独永远是 9x9 形式的。

分析:

    题目只是判断数独是不是正确,那么只需要判断横,列是否满足要求,然后判断每一个小方格是否满足要求就好了,我目前的想法就是暴力破解。这里用到了一个数据结构,是set,附上博客地址C++中set的用法

class Solution {
    set<char>temp;
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        initTemp();
        //判断行列
        for(int i=0;i<9;i++){
            if(!isValidRowsCol(board,i)){
                return false;
            }
        }
        //判断方框
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                if(!isValidRect(board,i,j))
                    return false;
            }
        }
        return true;
    }
    
    //判断row,col的那个方框
    bool isValidRect(vector<vector<char>> board,int row,int col){
        initTemp();
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
            if(!jugOne(board,row*3+i,col*3+j))
                return false;   
            }
        }
        return true;
    }
    
    //判断一行和一列有效
    bool isValidRowsCol(vector<vector<char>> board,int count){
        initTemp();
        //行
        for(int i=0;i<9;i++){
            if(!jugOne(board,count,i))
                return false;
        }
        //列
        initTemp();
        for(int i=0;i<9;i++){
            if(!jugOne(board,i,count))
                return false;
        }
        return true;
    }
    
    //初始化帮助数组
    void initTemp(){
        temp.clear();
        for(int i=1;i<10;i++){
            temp.insert(('0'+i));
        }
    }
    
    //判断一次的一个是否有效
    bool jugOne(vector<vector<char>> board,int i,int j){
        if('.' == board[i][j])
            return true;
        std::set<char>::iterator fin = temp.find(board[i][j]);
        if(fin != temp.end()){
            temp.erase(fin);
            return true;
        }
        return false;        
    }
};

 

展开阅读全文

没有更多推荐了,返回首页