forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cs
131 lines (124 loc) · 3.2 KB
/
Solution.cs
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
121
122
123
124
125
126
127
128
129
130
131
public class Solution {
public void SolveSudoku(char[][] board) {
this.board = new ushort?[9,9];
for (var i = 0; i < 9; ++i)
{
for (var j = 0; j < 9; ++j)
{
if (board[i][j] != '.')
{
this.board[i, j] = (ushort) (1 << (board[i][j] - '0' - 1));
}
}
}
if (SolveSudoku(0, 0))
{
for (var i = 0; i < 9; ++i)
{
for (var j = 0; j < 9; ++j)
{
if (board[i][j] == '.')
{
board[i][j] = '0';
while (this.board[i, j].Value != 0)
{
board[i][j] = (char)(board[i][j] + 1);
this.board[i, j] >>= 1;
}
}
}
}
}
}
private ushort?[,] board;
private bool ValidateHorizontalRule(int row)
{
ushort temp = 0;
for (var i = 0; i < 9; ++i)
{
if (board[row, i].HasValue)
{
if ((temp | board[row, i].Value) == temp)
{
return false;
}
temp |= board[row, i].Value;
}
}
return true;
}
private bool ValidateVerticalRule(int column)
{
ushort temp = 0;
for (var i = 0; i < 9; ++i)
{
if (board[i, column].HasValue)
{
if ((temp | board[i, column].Value) == temp)
{
return false;
}
temp |= board[i, column].Value;
}
}
return true;
}
private bool ValidateBlockRule(int row, int column)
{
var startRow = row / 3 * 3;
var startColumn = column / 3 * 3;
ushort temp = 0;
for (var i = startRow; i < startRow + 3; ++i)
{
for (var j = startColumn; j < startColumn + 3; ++j)
{
if (board[i, j].HasValue)
{
if ((temp | board[i, j].Value) == temp)
{
return false;
}
temp |= board[i, j].Value;
}
}
}
return true;
}
private bool SolveSudoku(int i, int j)
{
while (true)
{
if (j == 9)
{
++i;
j = 0;
}
if (i == 9)
{
return true;
}
if (board[i, j].HasValue)
{
++j;
}
else
{
break;
}
}
ushort stop = 1 << 9;
for (ushort t = 1; t != stop; t <<= 1)
{
board[i, j] = t;
if (ValidateHorizontalRule(i) && ValidateVerticalRule(j) && ValidateBlockRule(i, j))
{
if (SolveSudoku(i, j + 1))
{
return true;
}
}
}
board[i, j] = null;
return false;
}
}