forked from rising-entropy/Leetcode-Questions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGame_Of_Life.java
147 lines (130 loc) · 4.16 KB
/
Game_Of_Life.java
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
class Solution {
public static void main(String[] args) {
Solution sol = new Solution();
// int board[][] = { { 0, 1, 0 }, { 0, 0, 1 }, { 1, 1, 1 }, { 0, 0, 0 } };
int board[][] = { { 1, 1 }, { 1, 1 } };
sol.gameOfLife(board);
}
public void gameOfLife(int[][] board) {
int m = board.length;
int n = board[0].length;
int mtx[][] = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
mtx[i][j] = board[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int count_0 = 0;
int count_1 = 0;
int x = i - 1;
int y = j - 1;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i - 1;
y = j;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i - 1;
y = j + 1;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i;
y = j - 1;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i;
y = j;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i;
y = j + 1;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i + 1;
y = j - 1;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i + 1;
y = j;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
x = i + 1;
y = j + 1;
if (x >= 0 && y < n && x < m && y >= 0) {
int val = board[x][y];
if (val == 0)
count_0++;
else
count_1++;
}
if (board[i][j] == 0) {
count_0--;
if (count_1 == 3) {
mtx[i][j] = 1;
}
} else {
count_1--;
if (count_1 < 2) {
mtx[i][j] = 0;
}
if (count_1 == 2) {
mtx[i][j] = 1;
}
if (count_1 == 3) {
mtx[i][j] = 1;
}
if (count_1 > 3) {
mtx[i][j] = 0;
}
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
board[i][j] = mtx[i][j];
}
}
}
}