LeetCode 284. Peeking Iterator

描述

实现PeekingTterator这个类的方法

解决

调用父类的方法，用两个成员变量保存值和状态

---

// Below is the interface for Iterator, which is already defined for you.
// **DO NOT** modify the interface for Iterator.
class Iterator {
    struct Data;
    Data* data;
public:
    Iterator(const vector<int>& nums);
    Iterator(const Iterator& iter);
    virtual ~Iterator();
    // 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:
    bool has_{Iterator::hasNext()};
    int val{Iterator::next()};
    PeekingIterator(const vector<int>& nums) : Iterator(nums) {
        // Initialize any member here.
        // **DO NOT** save a copy of nums and manipulate it directly.
        // You should only use the Iterator interface methods.

    }

    // Returns the next element in the iteration without advancing the iterator.
    int peek() {
        return val;
    }

    // hasNext() and next() should behave the same as in the Iterator interface.
    // Override them if needed.
    int next() {
        int temp = val;
        (has_ = Iterator::hasNext()) ? val = Iterator::next() : 0; 
        return temp;
    }

    bool hasNext() const {
        return has_;
    }
};