LC-0284 Medium LeetCode

284. Peeking Iterator

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 60% Topics: Array, Design, Iterator

Reading material

Arrays & Hashing 12 min Design (Data Structures) 14 min

Reference solution (spoiler · python)

# Time:  O(1) per peek(), next(), hasNext()
# Space: O(1)

class PeekingIterator(object):
    def __init__(self, iterator):
        """
        Initialize your data structure here.
        :type iterator: Iterator
        """
        self.iterator = iterator
        self.val_ = None
        self.has_next_ = iterator.hasNext()
        self.has_peeked_ = False


    def peek(self):
        """
        Returns the next element in the iteration without advancing the iterator.
        :rtype: int
        """
        if not self.has_peeked_:
            self.has_peeked_ = True
            self.val_ = self.iterator.next()
        return self.val_

    def next(self):
        """
        :rtype: int
        """
        self.val_ = self.peek()
        self.has_peeked_ = False
        self.has_next_ = self.iterator.hasNext()
        return self.val_

    def hasNext(self):
        """
        :rtype: bool
        """
        return self.has_next_

Solution from kamyu104/LeetCode-Solutions · MIT