Magical String LeetCode solution in Python

1
# Runtime: 489 ms (Top 6.14%) | Memory: 14.1 MB (Top 72.07%)
2
class Solution:
3
    def magicalString(self, n: int) -> int:
4
        queue, ans, i = deque([2]), 1, 1
5

6
        while i <= n - 2:
7
            m = queue.popleft()
8
            ans += m == 1
9
            queue.extend([1 + (i % 2 == 0)] * m)
10
            i += 1
11

12
        return ans