class Solution {
public:
void gameOfLife(vector<vector<int>>& board) {
int movex[8]={0,0,-1,1,-1,1,-1,1};
int movey[8]={1,-1,0,0,-1,-1,1,1};
int m=board.size();
int n;
if (m>0) n=board[0].size();
int num[m+5][n+5];
for (int i=0;i<m;i++)
for (int j=0;j<n;j++){
int tip=0;
for (int p=0;p<8;p++){
if (i+movex[p]<0 || i+movex[p]>=m || j+movey[p]<0 || j+movey[p]>=n) continue;
if (board[i+movex[p]][j+movey[p]]==1) tip++;
}
if (board[i][j]==1){
if (tip<2 || tip>3) num[i][j]=0;
else num[i][j]=1;
}
else{
if (tip==3) num[i][j]=1;
else num[i][j]=0;
}
}
for (int i=0;i<m;i++)
for (int j=0;j<n;j++) board[i][j]=num[i][j];
}
};
[LeetCode]289. 生命游戏
最新推荐文章于 2022-10-07 14:03:42 发布