Leetcode:Valid Sudoku

来源:互联网 发布:java servlet生命周期 编辑:程序博客网 时间:2024/05/20 18:15

Valid Sudoku:

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.点击打开链接

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.


A partially filled sudoku which is valid.

Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.

         判断一个数独是不是合法的。就是检查每一行,每一列,以及每一个子九宫格矩阵,有没有重复数字。

实现代码:

class Solution {public:    bool isValidSudoku(vector<vector<char> > &board) {        for (int i = 0; i < 9; ++i) {            vector<int> count1(9, 0), count2(9, 0), count3(9, 0);            for (int j = 0; j < 9; ++j) {                if (board[i][j] != '.') {                    int num1 = board[i][j]-'1';                    if (count1[num1] != 0)                        return false;                    else                        count1[num1] = 1;                }                if (board[j][i] != '.') {                    int num2 = board[j][i]-'1';                    if (count2[num2] != 0)                        return false;                    else                        count2[num2] = 1;                }                if (board[i/3*3+j/3][i%3*3+j%3] != '.') {                    int num3 = board[i/3*3+j/3][i%3*3+j%3] - '1';                    if (count3[num3] != 0)                        return false;                    else                        count3[num3] = 1;                }            }        }        return true;    }};


0 0
原创粉丝点击