Python3 recursive with comments. 32ms 100%
```\nclass RLEIterator:\n\n    def init(self, A: List[int]):\n        self.A = A\n        self.current = 0\n\n    def next(self, n: int) -> int:\n        # If w
```\nclass RLEIterator:\n\n    def __init__(self, A: List[int]):\n        self.A = A\n        self.current = 0\n\n    def next(self, n: int) -> int:\n        # If we have exhausted all numbers in the sequence, return -1\n        if self.current == len(self.A):\n            return -1\n        \n        # Check if we are going to exhaust all of the current number we are looking at.\n        if self.A[self.current] < n:\n            n -= self.A[self.current]  # Decrement n by the amount of the current number.\n            self.current += 2  # Look at the next number.\n            return self.next(n)  # Return the next n in the sequence.\n\n        # If we are not going to exhaust all of the current number,\n        # decrement the amount exhausted by n and return the number.\n        self.A[self.current] -= n\n        return self.A[self.current + 1]\n\t\t
[]