Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::
class PeekingIterator : public Iterator {
    bool bPeeked;
    int val;
public:
    PeekingIterator(const vector<int>& nums) : Iterator(nums) {
        val = -1;
        bPeeked = false;
    }

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

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

    bool hasNext() const {
        return bPeeked || Iterator::hasNext();
    }
};
View Code
posted on 2015-09-21 15:27  Tonix  阅读(134)  评论(0编辑  收藏  举报