Prison Cells After N Days

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]

思路：这个变化，有可能产生loop，所以我们要做的是find这个loop cycle,  N = N % cycle; 怎么判断array的状态，解决方法就是：Arrays.toString(arr) 用string来表示array的状态。

class Solution {
    public int[] prisonAfterNDays(int[] cells, int N) {
        if(cells == null || cells.length == 0) {
            return cells;
        }
        int step = 0;
        boolean hasCycle = false;
        HashSet<String> visited = new HashSet<>();
        for(int i = 0; i < N; i++) {
            int[] next = nextDay(cells);
            String status = Arrays.toString(next);
            if(visited.contains(status)) {
                hasCycle = true;
                break;
            } else {
                visited.add(status);
                step++;
            }
            cells = next;
        }
        
        N = N % step;
        for(int i = 0; i < N; i++) {
            int[] next = nextDay(cells);
            cells = next;
        }
        return cells;
    }
    
    private int[] nextDay(int[] cells) {
        int n = cells.length;
        int[] res = new int[n];
        res[0] = res[n - 1] = 0;
        for(int i = 1; i < 7; i++) {
            res[i] = cells[i - 1] == cells[i + 1] ? 1 : 0;
        }
        return res;
    }
}