957. Prison Cells After N Days - LeetCode Solution


Hash

Python Code:

class Solution:
    def prisonAfterNDays(self, cell: List[int], n: int) -> List[int]:

        l = []

        count =0

        for i in range(n):

            r = []
            r.append(0)

            for j in range(1, len(cell) - 1, 1):
                if cell[j - 1] == cell[j + 1]:
                    r.append(1)

                else:
                    r.append(0)

            r.append(0)

            cell = r

            l.append(cell)

            if l[0] == cell and count!= 0:
                l.pop()
                break
            count=1




        return l[n%len(l) -1]


Comments

Submit
0 Comments
More Questions

507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm