leetcode/leetcode/36.valid-sudoku.cpp at master · geemaple/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
//  Tag: Array, Hash Table, Matrix
//  Time: O(N^2)
//  Space: O(N)
//  Ref: -
//  Note: -
//  Video: https://youtu.be/uTGP_TbEE2g

//  Determine if a 9 x 9 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 nine 3 x 3 sub-boxes of the grid must contain the digits 1-9 without repetition.
//
//  Note:
//
//  A Sudoku board (partially filled) could be valid but is not necessarily solvable.
//  Only the filled cells need to be validated according to the mentioned rules.
//
//
//  Example 1:
//
//
//  Input: board =
//  [["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"]]
//  Output: true
//
//  Example 2:
//
//  Input: board =
//  [["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"]]
//  Output: false
//  Explanation: Same as Example 1, except with the 5 in the top left corner being modified to 8. Since there are two 8's in the top left 3x3 sub-box, it is invalid.
//
//
//  Constraints:
//
//  board.length == 9
//  board[i].length == 9
//  board[i][j] is a digit 1-9 or '.'.
//
//

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int n = board.size();

        int row[9] = {0};
        int col[9] = {0};
        int sec[9] = {0};

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (board[i][j] == '.') {
                    continue;
                }

                int num = board[i][j] - '0';
                int bit = 1 << num;
                int k = i / 3 * 3 + j / 3;
                if (bit & row[i] || bit & col[j] || bit & sec[k]) {
                    return false;
                }

                row[i] |= bit;
                col[j] |= bit;
                sec[k] |= bit;
            }
        }

        return true;
    }
};

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int n = board.size();

        int row[9][9] = {0};
        int col[9][9] = {0};
        int zone[9][9] = {0};

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (board[i][j] == '.') {
                    continue;
                }

                int number = board[i][j] - '1';
                int k = i / 3 * 3 + j / 3;
                if (row[i][number] || col[j][number] || zone[k][number]) {
                    return false;
                }

                row[i][number] = 1;
                col[j][number] = 1;
                zone[k][number] = 1;
            }
        }

        return true;
    }
};