-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGame of Life
81 lines (77 loc) · 2.25 KB
/
Game of Life
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
class Solution {
public:
void gameOfLife(vector<vector<int>>& board) {
int n=board.size();
int m=board[0].size();
vector<vector<int>> grid=board;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
{
// int t=board[i][j];
int live=0,dead=0;
// if(t==1){
if(i-1>=0 && j-1>=0)
{
int t1=board[i-1][j-1];
if(t1==0)dead++;
else live++;
}
if(i-1>=0 )
{
int t1=board[i-1][j];
if(t1==0)dead++;
else live++;
}
if(i-1>=0 && j+1<m)
{
int t1=board[i-1][j+1];
if(t1==0)dead++;
else live++;
}
if(i>=0 && j-1>=0)
{
int t1=board[i][j-1];
if(t1==0)dead++;
else live++;
}
if( j+1<m)
{
int t1=board[i][j+1];
if(t1==0)dead++;
else live++;
}
if(i+1<n && j-1>=0)
{
int t1=board[i+1][j-1];
if(t1==0)dead++;
else live++;
}
if(i+1<n )
{
int t1=board[i+1][j];
if(t1==0)dead++;
else live++;
}
if(i+1<n && j+1<m)
{
int t1=board[i+1][j+1];
if(t1==0)dead++;
else live++;
}
if(board[i][j]==1)
{
if(live<2)grid[i][j]=0;
if(live==2 || live==3)grid[i][j]=1;
if(live>3)grid[i][j]=0;
}
else if(board[i][j]==0)
{
if(live==3)grid[i][j]=1;
}
else
grid[i][j]=board[i][j];
}
}
board=grid;
}
};