GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #281 - Zigzag Iterator - LeetCode JavaScript Solutions

Back to all solutions

#281 - Zigzag Iterator

Medium • View on LeetCode • View on GitHub

Array Design Queue Iterator

Problem Description

Given two vectors of integers v1 and v2, implement an iterator to return their elements alternately.

Implement the ZigzagIterator class:

ZigzagIterator(List<int> v1, List<int> v2) initializes the object with the two vectors v1 and v2.
boolean hasNext() returns true if the iterator still has elements, and false otherwise.
int next() returns the current element of the iterator and moves the iterator to the next element.

Solution

/**
 * @constructor
 * @param {Integer[]} v1
 * @param {Integer[]} v2
 */
var ZigzagIterator = function ZigzagIterator(v1, v2) {
  this.queue = [];
  if (v1.length) this.queue.push([v1, 0]);
  if (v2.length) this.queue.push([v2, 0]);
};

/**
 * @this ZigzagIterator
 * @returns {boolean}
 */
ZigzagIterator.prototype.hasNext = function hasNext() {
  return this.queue.length > 0;
};

/**
 * @this ZigzagIterator
 * @returns {integer}
 */
ZigzagIterator.prototype.next = function next() {
  const [vector, index] = this.queue.shift();
  const value = vector[index];

  if (index + 1 < vector.length) {
    this.queue.push([vector, index + 1]);
  }

  return value;
};

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.