Is my solution ok?

  • 0
    // **DO NOT** modify the interface for Iterator.
    class Iterator {
        struct Data;
    	Data* data;
    	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 {
        vector<int>::const_iterator f, l;
    	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.
    	    f = nums.begin();
            l = nums.end();
        // Returns the next element in the iteration without advancing the iterator.
    	int peek() {
            return *f;
    	// hasNext() and next() should behave the same as in the Iterator interface.
    	// Override them if needed.
    	int next() {
    	    int ans = *f;
            return ans;
    	bool hasNext() const {
    	    return !(f == l);

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.