[leetcode] 284. Peeking Iterator 解题报告

题目链接: https://leetcode.com/problems/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().

---

Here is an 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.

Hint:

1. Think of "looking ahead". You want to cache the next element.Show More Hint 

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

思路: 好久没搞懂这题到底要干嘛!!! 说是有了一个基类, 然后再派生一个子类, 但是子类比基类多了一个函数peek, 这样在调用peek的时候不移动指针, 但是调用next的时候要移动指针. 所以我们需要预先拿到下一个值, 当调用peek的时候直接给他存好的值, 而调用next的时候需要移动指针取到再下一个值. 我们需要两个标记, 一个用来存值, 一个用来保存是否下一个存在. 而如果要做到通用的话就要用到泛型了. 

// 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.
	    isHasNext = Iterator::hasNext();
	    if(isHasNext) nextVal = Iterator::next();
	}

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

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

	bool hasNext() const {
	    return isHasNext;
	}
private:
    bool isHasNext;
    int nextVal;
};