900. RLE Iterator
题目如下:
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.d
解决方法:
第一思路: 在构建函数的时候,将编码的序列,直接解码,存储在class的内部存储vector<int>中,在调用next的时候,不断的移动指示标识index,初始时为0,随着next的访问不断的变化,结果就是Exceed Time Limit。
肯定不行啦。
第二思路:
不解释,就按照编码的形式存储在class内部,访问的时候在处理移动,本人最不喜欢这种动脑筋的方法,但也没办法。
于是乎,接替代码如下。
class RLEIterator {
private:
vector<int> data;
int index;
public:
RLEIterator(vector<int>& A) {
index = 0;
data = std::forward<vector<int>>(A); //这一行,比data=A对效率有所影响
}
int next(int n) {
while(n > 0)
{
if(index >= data.size())
return -1;
auto c = data[index];
if ( c > n )
{
data[index] = c - n;
return data[index + 1];
}
else if (c == n)
{
index = index + 2;
return data[index - 1];
}
else
{
n = n - c;
index = index + 2;
}
}
return -1;
}
};