[leetcode] 900. RLE Iterator @ python

原题

Write an iterator that iterates through a run-length encoded sequence.

The iterator is initialized by RLEIterator(int[] A), where A is a run-length encoding of some sequence. More specifically, for all even i, A[i] tells us the number of times that the non-negative integer value A[i+1] is repeated in the sequence.

The iterator supports one function: next(int n), which exhausts the next n elements (n >= 1) and returns the last element exhausted in this way. If there is no element left to exhaust, next returns -1 instead.

For example, we start with A = [3,8,0,9,2,5], which is a run-length encoding of the sequence [8,8,8,5,5]. This is because the sequence can be read as “three eights, zero nines, two fives”.

Example 1:

Input: [“RLEIterator”,“next”,“next”,“next”,“next”], [[[3,8,0,9,2,5]],[2],[1],[1],[2]]
Output: [null,8,8,5,-1]
Explanation:
RLEIterator is initialized with RLEIterator([3,8,0,9,2,5]).
This maps to the sequence [8,8,8,5,5].
RLEIterator.next is then called 4 times:

.next(2) exhausts 2 terms of the sequence, returning 8. The remaining sequence is now [8, 5, 5].

.next(1) exhausts 1 term of the sequence, returning 8. The remaining sequence is now [5, 5].

.next(1) exhausts 1 term of the sequence, returning 5. The remaining sequence is now [5].

.next(2) exhausts 2 terms, returning -1. This is because the first term exhausted was 5,
but the second term did not exist. Since the last term exhausted does not exist, we return -1.

Note:

0 <= A.length <= 1000
A.length is an even integer.
0 <= A[i] <= 10^9
There are at most 1000 calls to RLEIterator.next(int n) per test case.
Each call to RLEIterator.next(int n) will have 1 <= n <= 10^9.

解法

while循环, 每次只读取第一个数字, 如果计数为0则删除该数字和计数, 如果计数>= n则表示最后一个数字是该数字, 计数减n即可. 如果计数 < n, 则删除该数字和计数. 当跳出循环后n为正, 返回-1.

代码

class RLEIterator(object):

    def __init__(self, A):
        """
        :type A: List[int]
        """
        self.data = A

    def next(self, n):
        """
        :type n: int
        :rtype: int
        """
        while len(self.data) > 0:
            if self.data[0] == 0:
                # skip the number with count 0
                self.data = self.data[2:]                
            elif self.data[0] >= n:
                self.data[0] -= n
                return self.data[1]            
            else:
                # delete the first number, go to the next number
                n -= self.data[0]
                self.data = self.data[2:]
                
        if n > 0:
            return -1


# Your RLEIterator object will be instantiated and called as such:
# obj = RLEIterator(A)
# param_1 = obj.next(n)