284. Peeking Iterator

Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation – it essentially peek() at the element that will be returned by the next call to next().

Example:

Assume that the iterator is initialized to the beginning of the list: [1,2,3].
Call next() gets you 1, the first element in the list.
Now you call peek() and it returns 2, the next element. Calling next() after that still return 2. 
You call next() the final time and it returns 3, the last element. 
Calling hasNext() after that should return false.

Follow up:

How would you extend your design to be generic and work with all types, not just integer?

方法1:

思路：

和一般的iterator相比，主要是多了一个peek的技能。每次next其实都会前进一个iter，但是要造成一种假象成并没有前进。也就是说，当连续peek并next，返回应该是同一个值。那么就要prevent next再一次前进，可以用一个bool变量来标记，并且将这个值存下来。如果已经取过这个值了，那么next只用返回这个value。hasNext也变成了有这个flag或者还有下一个值。

易错点

1. 初始需要将flag设好，直接query flag会造成undefined error。
2. 每次peek的值被用掉了，要恢复flag默认值
3. 最后的hasNext也需要检查_flag里面有没有存储值

// 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:
	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.
	    _peeked = false;
	}

    // Returns the next element in the iteration without advancing the iterator.
	int peek() {
        if (!_peeked) _value = Iterator::next();
        _peeked = true;
        return _value;
	}

	// hasNext() and next() should behave the same as in the Iterator interface.
	// Override them if needed.
	int next() {
	    if (_peeked) {
            _peeked= false;
            return _value;
        }
        if (Iterator::hasNext())
            return Iterator::next();
        return -1;
	}

	bool hasNext() const {
	    return _peeked || Iterator::hasNext();
	}
private:
    bool _peeked;
    int _value;
};

方法2:

grandyang: http://www.cnblogs.com/grandyang/p/4825068.html
思路：

这个方法利用了c++内部的copy constructor，而且construct的只是一个临时的Iterator，并不耗费多余空间，用完后被virtual destructor自动销毁，可以说是非常机智了。

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:
    PeekingIterator(const vector<int>& nums) : Iterator(nums) {}

    int peek() {
        return Iterator(*this).next();
    }

    int next() {
        return Iterator::next();
    }

    bool hasNext() const {
        return Iterator::hasNext();
    }
};