leetcode：284. 顶端迭代器

题目来源

• leetcode

题目描述

题目解析

class Iterator {
    struct Data;
    Data* data;
public:
    Iterator(const vector<int>& nums);
    Iterator(const Iterator& iter);

    // Returns the next element in the iteration.
    int next();

    // Returns true if the iteration has more elements.
    bool hasNext() const;
};


class PeekingIterator : public Iterator {
public:
    PeekingIterator(const vector<int>& nums) : Iterator(nums) {
        // 先看是不是存在下一个元素
        exist = Iterator::hasNext();
        if(exist){
            nextValue = Iterator::next();
        }
    }

    int peek() {
        return nextValue;
    }

    int next() {
        int tmp = nextValue;  // 取出当前元素
        exist = Iterator::hasNext(); // 判断还有没有下一个元素
        if(exist){
            nextValue = Iterator::next();  //有的话就去取出
        }
        return tmp;
    }
    
    bool hasNext(){
        return exist;
    }
    
    
private:
    int nextValue;  
    bool exist;
};