957. Prison Cells After N Days

最新推荐文章于 2020-04-28 12:25:23 发布

原创最新推荐文章于 2020-04-28 12:25:23 发布 · 305 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

558 篇文章

订阅专栏

math

88 篇文章

订阅专栏

本文介绍了一个基于特定规则的监狱细胞状态模拟算法。在一个由8个细胞组成的行中，每个细胞的状态（占用或空置）每天根据相邻细胞的状态变化。通过发现状态变化的周期性，算法高效地预测了N天后的细胞状态。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

There are 8 prison cells in a row, and each cell is either occupied or vacant.

Each day, whether the cell is occupied or vacant changes according to the following rules:

If a cell has two adjacent neighbors that are both occupied or both vacant, then the cell becomes occupied.
Otherwise, it becomes vacant.

(Note that because the prison is a row, the first and the last cells in the row can't have two adjacent neighbors.)

We describe the current state of the prison in the following way: cells[i] == 1 if the i-th cell is occupied, else cells[i] == 0.

Given the initial state of the prison, return the state of the prison after N days (and N such changes described above.)

Example 1:

Input: cells = [0,1,0,1,1,0,0,1], N = 7
Output: [0,0,1,1,0,0,0,0]
Explanation: 
The following table summarizes the state of the prison on each day:
Day 0: [0, 1, 0, 1, 1, 0, 0, 1]
Day 1: [0, 1, 1, 0, 0, 0, 0, 0]
Day 2: [0, 0, 0, 0, 1, 1, 1, 0]
Day 3: [0, 1, 1, 0, 0, 1, 0, 0]
Day 4: [0, 0, 0, 0, 0, 1, 0, 0]
Day 5: [0, 1, 1, 1, 0, 1, 0, 0]
Day 6: [0, 0, 1, 0, 1, 1, 0, 0]
Day 7: [0, 0, 1, 1, 0, 0, 0, 0]

Example 2:

Input: cells = [1,0,0,1,0,0,1,0], N = 1000000000
Output: [0,0,1,1,1,1,1,0]

Note:

cells.length == 8
cells[i] is in {0, 1}
1 <= N <= 10^9

思路：最多也就2^8种可能，一定有周期的。唯一要注意的就是在进入周期循环前可能又有一段启动的步骤

class Solution(object):
    def prisonAfterNDays(self, cells, N):
        """
        :type cells: List[int]
        :type N: int
        :rtype: List[int]
        """
        N-=1
        cells[1:7] = [1 if cells[j-1]==cells[j+1] else 0  for j in range(1,7)]
        cells[0]=cells[-1]=0
        
        vis={''.join(list(map(str,cells))):0}
        i=1
        while i<N+1:
            cells[1:7] = [1 if cells[j-1]==cells[j+1] else 0  for j in range(1,7)]
            if ''.join(list(map(str,cells))) in vis: break
            vis[''.join(list(map(str,cells)))] = i
            i+=1
        
        if i==N+1: return cells
        peroid = i-vis[''.join(list(map(str,cells)))]
        start = vis[''.join(list(map(str,cells)))]
        N-=start
        N%=peroid
        for i in range(N):
            cells[1:7] = [1 if cells[j-1]==cells[j+1] else 0  for j in range(1,7)]
        return cells
    
    
s=Solution()
print(s.prisonAfterNDays(cells = [1, 1, 0, 1, 1, 0, 1, 1], N = 6))
print(s.prisonAfterNDays(cells = [0,1,0,1,1,0,0,1], N = 7))
print(s.prisonAfterNDays(cells = [1,0,0,1,0,0,1,0], N = 1000000000))