leetcode957. N 天后的牢房

https://leetcode-cn.com/problems/prison-cells-after-n-days/submissions/
这道题，第一反应肯定不是挨个算过去，毕竟N的值可以特别大
然后注意到重点，数组的长度固定，意味着可能性固定
而一个状态变成另一个状态的变化是固定的
意味着，无论N为多少，后面都是循环
只要把循环的去掉就行

public int[] prisonAfterNDays(int[] cells, int N) {
    int[] steps = new int[256];
    int[] scores = new int[257];
    for (int i = 0; i < N; i++) {
        int score = getScore(cells);
        if (steps[score] > 0) {
            int xunh = i - steps[score] + 1;
            int key = (N + 1 - steps[score]) % xunh + steps[score];//之所以加1,是因为第一种状态是初始状态
            return changeTo(scores[key]);
        } else {
            steps[score] = i + 1;//防止i=0
            scores[i + 1] = score;
        }
        dada(cells);
    }
    return cells;
}

public int getScore(int[] cells) {
    int score = 0;
    for (int i = 7; i >= 0; i--) {
        score *= 2;
        score += cells[i];
    }
    return score;
}

public int[] changeTo(int score) {
    int[] cells = new int[8];
    for (int i = 0; i < 8; i++) {
        cells[i] = score % 2;
        score = score / 2;
    }
    return cells;
}

public void dada(int[] cells) {
    int[] newce = new int[8];
    for (int i = 1; i < 7; i++) {
        if (cells[i - 1] == cells[i + 1]) {
            newce[i] = 1;
        }
    }
    for (int i = 0; i < 8; i++) {
        cells[i] = newce[i];
    }
}