zoukankan      html  css  js  c++  java
  • [LeetCode] Peeking Iterator

    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.
    2. Is one variable sufficient? Why or why not?
    3. Test your design with call order of peek() before next() vs next() before peek().
    4. For a clean implementation, check out Google's guava library source code.

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

     1 // Below is the interface for Iterator, which is already defined for you.
     2 // **DO NOT** modify the interface for Iterator.
     3 class Iterator {
     4     struct Data;
     5     Data* data;
     6 public:
     7     Iterator(const vector<int>& nums);
     8     Iterator(const Iterator& iter);
     9     virtual ~Iterator();
    10     // Returns the next element in the iteration.
    11     int next();
    12     // Returns true if the iteration has more elements.
    13     bool hasNext() const;
    14 };
    15 
    16 
    17 class PeekingIterator : public Iterator {
    18 private:
    19     bool hasPeeked;
    20     int peekElement;
    21 public:
    22     PeekingIterator(const vector<int>& nums) : Iterator(nums) {
    23         // Initialize any member here.
    24         // **DO NOT** save a copy of nums and manipulate it directly.
    25         // You should only use the Iterator interface methods.
    26         hasPeeked = false;
    27     }
    28 
    29     // Returns the next element in the iteration without advancing the iterator.
    30     int peek() {
    31         if (!hasPeeked) {
    32             hasPeeked = true;
    33             peekElement = Iterator::next();
    34         }
    35         return peekElement;
    36     }
    37 
    38     // hasNext() and next() should behave the same as in the Iterator interface.
    39     // Override them if needed.
    40     int next() {
    41         if (!hasPeeked) {
    42             return Iterator::next();
    43         }
    44         hasPeeked = false;
    45         return peekElement;
    46     }
    47 
    48     bool hasNext() const {
    49         return hasPeeked || Iterator::hasNext();
    50     }
    51 };
  • 相关阅读:
    服务器变量 $_SERVER 详解
    PHP 函数功能参考
    ecshop后台0day漏洞原理+利用方法 XSS+Getshll
    CSRF漏洞原理说明与利用方法
    Drupal 远程命令执行漏洞(CVE-2018-7600)
    SSH登陆验证绕过漏洞(cve-2018-10933)
    单元二:建立和维护数据表
    单元一:认识数据库系统
    【 模块1 认识计算机 】1.2 认识微型计算机
    【 模块1 认识计算机 】 1.1走进计算机世界
  • 原文地址:https://www.cnblogs.com/easonliu/p/4826936.html
Copyright © 2011-2022 走看看