forked from shuboc/LeetCode-2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
valid-tic-tac-toe-state.cpp
54 lines (51 loc) · 1.79 KB
/
valid-tic-tac-toe-state.cpp
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
// Time: O(1)
// Space: O(1)
class Solution {
public:
bool validTicTacToe(vector<string>& board) {
const auto FIRST = 'X', SECOND = 'O';
const auto x_count =
accumulate(board.cbegin(), board.cend(), 0,
[&FIRST](int accu, const string& s) {
return accu + count(s.cbegin(), s.cend(), FIRST);
});
const auto o_count =
accumulate(board.cbegin(), board.cend(), 0,
[&SECOND](int accu, const string& s) {
return accu + count(s.cbegin(), s.cend(), SECOND);
});
if (o_count != x_count - 1 && o_count != x_count) {
return false;
}
if (isWin(board, FIRST) && o_count != x_count - 1) {
return false;
}
if (isWin(board, SECOND) && o_count != x_count) {
return false;
}
return true;
}
private:
bool isWin(const vector<string>& board, char player) {
for (int i = 0; i < board.size(); ++i) {
if (all_of(board[i].cbegin(), board[i].cend(),
[&player](const char& c) {
return c == player;
})) {
return true;
}
if (all_of(board.cbegin(), board.cend(),
[&i, &player](const string& row) {
return row[i] == player;
})) {
return true;
}
}
return (player == board[1][1] &&
board[1][1] == board[0][0] &&
board[0][0] == board[2][2]) ||
(player == board[1][1] &&
board[1][1] == board[0][2] &&
board[0][2] == board[2][0]);
}
};