【Leetcode】284. Peeking Iterator

题目地址：

https://leetcode.com/problems/peeking-iterator/

要求实现一个迭代器，能实现下列功能：
1、初始化参数是一个迭代器；
2、实现普通迭代器的hasNext和next功能；
3、实现peek功能，peek的返回值是调用它next的时候的返回值，但是调用peek之后再调用next的时候，要求两者返回值相同。

用一个变量存一下peek的数即可。代码如下：

/*
 * 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);
 *
 * 		// 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:
  int cur;
  bool has_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.
    has_next = Iterator::hasNext();
    if (has_next) cur = Iterator::next();
  }

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

  // hasNext() and next() should behave the same as in the Iterator interface.
  // Override them if needed.
  int next() {
    int res = cur;
    has_next = Iterator::hasNext();
    if (has_next) cur = Iterator::next();
    return res;
  }

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

所有操作时空复杂度$O(1)$。