LeetCode 289. Game of Life(生命游戏)
来源:互联网 发布:改革开放问题 知乎 编辑:程序博客网 时间:2024/05/16 17:16
原题网址:https://leetcode.com/problems/game-of-life/
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?
方法:使用高位比特来保存下一步的状态。
public class Solution { public void gameOfLife(int[][] board) { int right = board[0].length-1; int bottom = board.length-1; for(int i=0; i<board.length; i++) { for(int j=0; j<board[i].length; j++) { int live = 0; for(int io=-1; io<=1; io++) { for(int jo=-1; jo<=1; jo++) { if (io==0 && jo==0) continue; int row = i+io, col = j+jo; if (row>=0 && row<board.length && col>=0 && col<board[row].length && (board[row][col]&1)==1) live ++; } } if ((board[i][j]&1) == 1) { if (2 <= live && live <= 3) board[i][j] |= 0b10; } else { if (live == 3) board[i][j] |= 0b10; } } } for(int i=0; i<board.length; i++) { for(int j=0; j<board[i].length; j++) { board[i][j] >>= 1; } } }}
0 0
- 289. Game of Life-LeetCode(生命游戏)
- LeetCode 289. Game of Life(生命游戏)
- LeetCode 289. Game of Life(生命游戏)
- LeetCode 289 Game of Life(生命游戏)(Array)
- 生命游戏(Game of Life)
- Unity3d实现生命游戏(game Of Life)
- python实现生命游戏(Game of Life)
- 生命游戏(Game Of Life)结对编程体验
- 康威生命游戏 Conway's game of life
- [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
- Android 自定义View之随手指滑动的ToggleButton
- 个人收藏
- OCI
- sublime_中使用正则表达式查找替换
- LeetCode 291. Word Pattern II(单词模式II)
- LeetCode 289. Game of Life(生命游戏)
- LeetCode 290. Word Pattern(单词模式)
- LeetCode 56. Merge Intervals
- LeetCode 292. Nim Game(取物游戏)
- java泛型的使用(一)定义类时,使用泛型
- java泛型的使用(二)在实例化对象时不指定泛型,则自动识别为object
- LeetCode 293. Flip Game(反转游戏)
- java泛型的使用(三)通配符的使用
- java泛型的使用(四)设置泛型的时候,只能是Number或者Number的子类(int,float)等