[Swift]LeetCode900. RLE 迭代器 | RLE Iterator

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10607679.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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 nelements (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:

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

---

编写一个遍历游程编码序列的迭代器。

迭代器由 RLEIterator(int[] A) 初始化，其中 A 是某个序列的游程编码。更具体地，对于所有偶数 i，A[i] 告诉我们在序列中重复非负整数值 A[i + 1] 的次数。

迭代器支持一个函数：next(int n)，它耗尽接下来的  n 个元素（n >= 1）并返回以这种方式耗去的最后一个元素。如果没有剩余的元素可供耗尽，则  next 返回 -1 。

例如，我们以 A = [3,8,0,9,2,5] 开始，这是序列 [8,8,8,5,5] 的游程编码。这是因为该序列可以读作 “三个八，零个九，两个五”。 

示例：

输入：["RLEIterator","next","next","next","next"], [[[3,8,0,9,2,5]],[2],[1],[1],[2]]
输出：[null,8,8,5,-1]
解释：
RLEIterator 由 RLEIterator([3,8,0,9,2,5]) 初始化。
这映射到序列 [8,8,8,5,5]。
然后调用 RLEIterator.next 4次。

.next(2) 耗去序列的 2 个项，返回 8。现在剩下的序列是 [8, 5, 5]。

.next(1) 耗去序列的 1 个项，返回 8。现在剩下的序列是 [5, 5]。

.next(1) 耗去序列的 1 个项，返回 5。现在剩下的序列是 [5]。

.next(2) 耗去序列的 2 个项，返回 -1。 这是由于第一个被耗去的项是 5，
但第二个项并不存在。由于最后一个要耗去的项不存在，我们返回 -1。 

提示：

1. 0 <= A.length <= 1000
2. A.length 是偶数。
3. 0 <= A[i] <= 10^9
4. 每个测试用例最多调用 1000 次 RLEIterator.next(int n)。
5. 每次调用 RLEIterator.next(int n) 都有 1 <= n <= 10^9 。

---

Runtime: 24 ms

Memory Usage: 19.6 MB

class RLEIterator {
    var index:Int
    var A:[Int]

    init(_ A: [Int]) {
        self.A = A
        index = 0        
    }
    
    func next(_ n: Int) -> Int {
        var n = n
        while(index < A.count && n > A[index])
        {
            n -= A[index]
            index += 2
        }
        if index >= A.count
        {
            return -1
        }
        A[index] -= n;
        return A[index + 1]      
    }
}

/**
 * Your RLEIterator object will be instantiated and called as such:
 * let obj = RLEIterator(A)
 * let ret_1: Int = obj.next(n)
 */
 

---

24ms

class RLEIterator {
    let array : [Int] 
    var currentPosition = 0
    var currentCount = 0
    
    init(_ A: [Int]) {
        array = A 
    }
    
    func next(_ n: Int) -> Int {
        var n = n
        
        while currentPosition < array.count {
            if currentCount + n > array[currentPosition] {
                n = n - (array[currentPosition] - currentCount)
                currentCount = 0
                currentPosition += 2    
            } else {
                currentCount += n                         
                return array[currentPosition + 1]
            }
        }       
        return -1 
    }
}

---

32ms

class RLEIterator {

    init(_ A: [Int]) {
        var i = A.count - 2
        while i >= 0 {
            store.append(Record(A[i + 1], A[i]))
            i -= 2
        }
    }
    
    func next(_ n: Int) -> Int {
        var n = n
        while !store.isEmpty {
            let k = min(store.last!.cnt, n)
            store[store.count - 1].cnt -= k
            n -= k
            if n == 0 {
                return store.last!.val
            }
            if store.last!.cnt == 0 {
                store.removeLast()
            }
        }
        return -1
    }
    
    struct Record {
        var val: Int
        var cnt: Int
        init(_ val: Int, _ cnt: Int) {
            self.val = val
            self.cnt = cnt
        }
    }
    var store = [Record]()
}

---

40ms

class RLEIterator {
    private let arr: [Int]
    var cur = (0, 0)
    
    init(_ A: [Int]) {
        arr = A
        cur = (0, A[0])
    }
    
    func next(_ n: Int) -> Int {
        // diff = 2 | 1 | 1 | 2
        var diff = n 
        // cur == (0, 3) | (0, 1) | (0,0) | (4,1)
        // 3 - 2 < 0 => false, | 1 - 1 < 0 => false | 0-1 < 0 => true;0-1<0=>true;2-1<0=>false | 1 - 2 < 0 => true
        while (cur.1 - diff) < 0 { 
            //||1;1| 1
            diff -= cur.1 
            // || (2, 0);(4,0)|(6,1)
            cur.0 += 2      
            if cur.0 >= arr.count {
                return -1
            }
            // || (2, 0);(4,2)|(6)
            cur.1 = arr[cur.0]  
        }
        // (0,3) -> (0,1) | (0, 1) -> (0, 0) | (4,2) -> (4,1)
        cur.1 -= diff 
        // false
        if cur.0+1 >= arr.count { 
            return -1
        }
         // 8 | 8 | 5
        return arr[cur.0+1]
    }
}