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):
Write a function to compute the next state (after one update) of the board given its current state.
Follow up:
Analyse: You could use aid vector to record the transferred state, or set different values while transfer without the aid vector.
class Solution { public: // get the transfer state of board after one update vector<vector<int> > transferState(vector<vector<int> > &board) { vector<vector<int> > tempResult(board.size(), vector<int>(board[0].size(), -1)); // compute the number of neighbours‘ 1 for(int i = 0; i < board.size(); i++) { for(int j = 0; j < board[i].size(); j++) { int neighbor = 0; for(int m = i - 1; m <= i + 1; m++) { if(m < 0 || m >= board.size()) continue; for(int n = j - 1; n <= j + 1; n++) { if(n < 0 || n >= board[i].size() || (m == i && n == j)) continue; if(board[m][n] == 1) neighbor++; } } if(board[i][j] == 1) tempResult[i][j] = (neighbor == 2 || neighbor == 3) ? 1 : 0; else tempResult[i][j] = neighbor == 3 ? 1 : 0; } } return tempResult; } // compute the result after the transfer void computeResult (vector<vector<int> > tempResult, vector<vector<int> >& board) { for(int i = 0; i < board.size(); i++) for(int j = 0; j < board[i].size(); j++) board[i][j] = tempResult[i][j]; } void gameOfLife(vector<vector<int>>& board) { if(board.empty() || board[0].empty()) return; vector<vector<int> > tempResult = transferState(board); computeResult(tempResult, board); } };
原文：http://www.cnblogs.com/amazingzoe/p/5724439.html