Leetcode 289. Game of Life
来源:互联网 发布:东北财经大学网络教育 编辑:程序博客网 时间:2024/06/06 23:51
According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."
Given a board with m by n cells, each cell has an initial state live (1) or dead (0). Each cell interacts with its eight neighbors (horizontal, vertical, diagonal) using the following four rules (taken from the above Wikipedia article):
- Any live cell with fewer than two live neighbors dies, as if caused by under-population.
- Any live cell with two or three live neighbors lives on to the next generation.
- Any live cell with more than three live neighbors dies, as if by over-population..
- Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
Write a function to compute the next state (after one update) of the board given its current state.
Follow up:
- Could you solve it in-place? Remember that the board needs to be updated at the same time: You cannot update some cells first and then use their updated values to update other cells.
- In this question, we represent the board using a 2D array. In principle, the board is infinite, which would cause problems when the active area encroaches the border of the array. How would you address these problems?
既然不能开新的数组,就只能通过原始数组记录了,考虑到0和1只占用最后一位,那么可以用其他bit位存储更新后的状态。
class Solution {public: void gameOfLife(vector<vector<int>>& board) { int dir[8][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; int n = board.size(); if(!n) return; int m = board[0].size(); for(int i = 0; i < n; i++) { for(int j = 0; j < m; j++) { int cnt = 0; for(int k = 0; k < 8 ; k++) { int x = i + dir[k][0], y = j + dir[k][1]; if(x < 0 || x >= n || y < 0 || y >= m) continue; if(board[x][y] & 1) cnt++; } if(cnt == 2) board[i][j] |= (board[i][j] & 1) << 1; else if(cnt == 3) board[i][j] |= 1 << 1; } } for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) board[i][j] >>= 1; }};
1 0
- [leetcode] 289. Game of Life
- 289. Game of Life LeetCode
- leetcode 289. Game of Life
- [LeetCode]289. Game of Life
- LeetCode 289. Game of Life
- LeetCode *** 289. Game of Life
- 【leetcode】289. Game of Life
- LeetCode 289. Game of Life
- LeetCode-289.Game of Life
- [Leetcode]289. Game of Life
- LeetCode--289. Game of Life
- [leetcode] 289. Game of Life
- [LeetCode] 289. Game of Life
- [leetcode]289. Game of Life
- [LeetCode]289. Game of Life
- [LeetCode]289. Game of Life
- 【LeetCode】 289. Game of Life
- LeetCode 289. Game of Life
- java文件字符流分割法上传和下载
- CDR X8撤销、重做与重复操作方法介绍
- webView播放(打开)网页上的视频
- 团体程序设计天梯赛L2-021 点赞狂魔
- PHP-Websockets 上传文件2 优化支持php socket客户端和websocket连接websocket服务器 以守护进程方式运行编码
- Leetcode 289. Game of Life
- 关于LocalBroadcastManager 使用程序崩溃的问题
- 蛋糕
- three.js 灯光的代替模型
- jQuery动态修改placeholder和获取文本光标
- 给自己一个开始
- Ubuntu 16.04 LTS 安装 Nginx/PHP 7/MySQL
- C++中使用重载()来实现闭包
- android 简单的计算器的源码