-
Notifications
You must be signed in to change notification settings - Fork 0
/
348.Tictactoe.py
96 lines (78 loc) · 3.16 KB
/
348.Tictactoe.py
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
Given n = 3, assume that player 1 is "X" and player 2 is "O" in the board.
TicTacToe toe = new TicTacToe(3);
toe.move(0, 0, 1); -> Returns 0 (no one wins)
|X| | |
| | | | // Player 1 makes a move at (0, 0).
| | | |
toe.move(0, 2, 2); -> Returns 0 (no one wins)
|X| |O|
| | | | // Player 2 makes a move at (0, 2).
| | | |
toe.move(2, 2, 1); -> Returns 0 (no one wins)
|X| |O|
| | | | // Player 1 makes a move at (2, 2).
| | |X|
toe.move(1, 1, 2); -> Returns 0 (no one wins)
|X| |O|
| |O| | // Player 2 makes a move at (1, 1).
| | |X|
toe.move(2, 0, 1); -> Returns 0 (no one wins)
|X| |O|
| |O| | // Player 1 makes a move at (2, 0).
|X| |X|
toe.move(1, 0, 2); -> Returns 0 (no one wins)
|X| |O|
|O|O| | // Player 2 makes a move at (1, 0).
|X| |X|
toe.move(2, 1, 1); -> Returns 1 (player 1 wins)
|X| |O|
|O|O| | // Player 1 makes a move at (2, 1).
|X|X|X|
class TicTacToe(object):
def __init__(self, n):
"""
Initialize your data structure here.
:type n: int
"""
self.n = n
self.rowMoveCount1 = [0] * n # maps k to how many pos in row k are occupied by player 1
self.rowMoveCount2 = [0] * n # maps k to how many pos in row k are occupied by player 2
self.colMoveCount1 = [0] * n # maps k to how many pos in col k are occupied by player 1
self.colMoveCount2 = [0] * n # maps k to how many pos in col k are occupied by player 2
self.mainDiagMoveCount1 = [0] # how many pos in main diag (row==col) are occupied by player 1
self.mainDiagMoveCount2 = [0] # how many pos in main diag (row==col) are occupied by player 2
self.antiDiagMoveCount1 = [0] # how many pos in anti diag (row+col==n-1) are occupied by player 1
self.antiDiagMoveCount2 = [0] # how many pos in anti diag (row+col==n-1) are occupied by player 2
def move(self, row, col, player):
"""
Player {player} makes a move at ({row}, {col}).
@param row The row of the board.
@param col The column of the board.
@param player The player, can be either 1 or 2.
@return The current winning condition, can be either:
0: No one wins.
1: Player 1 wins.
2: Player 2 wins.
:type row: int
:type col: int
:type player: int
:rtype: int
"""
assert player==1 or player==2
rowCountList = self.rowMoveCount1 if player==1 else self.rowMoveCount2
colCountList = self.colMoveCount1 if player==1 else self.colMoveCount2
mainDiagCountList = self.mainDiagMoveCount1 if player==1 else self.mainDiagMoveCount2
antiDiagCountList = self.antiDiagMoveCount1 if player==1 else self.antiDiagMoveCount2
rowCountList[row] += 1
colCountList[col] += 1
if row == col:
mainDiagCountList[0] += 1
if row + col == self.n - 1:
antiDiagCountList[0] += 1
if self.n in [ rowCountList[row], colCountList[col], mainDiagCountList[0], antiDiagCountList[0] ]:
return player
else:
return 0
# Your TicTacToe object will be instantiated and called as such:
# obj = TicTacToe(n)
# param_1 = obj.move(row,col,player)