Queue - Michael's Blog

Queue

A collection of 5 posts

Moving Average from Data Stream

346. Moving Average from Data Stream [https://leetcode.com/problems/moving-average-from-data-stream/] Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. For example, MovingAverage m = new MovingAverage(3); m.next(1) = 1 m.next(10) = (1 + 10) / 2 m.next(

Implement Queue by Linked List II

LintCode-493.Implement Queue by Linked List II [http://www.lintcode.com/en/problem/implement-queue-by-linked-list-ii/] > Implement a Queue by linked list. Provide the following basic methods: > 1. push_front(item). Add a new item to the front of queue. 2. push_back(item). Add a new item to the back of

Implement Queue by Linked List

LintCode-492.Implement Queue by Linked List [http://www.lintcode.com/en/problem/implement-queue-by-linked-list/] > Implement a Queue by linked list. Support the following basic methods: 1. enqueue(item). Put a new item in the queue. 2. dequeue(). Move the first item out of the queue, return it. This problem you need

Implement Queue by Two Stacks

LintCode-40.Implement Queue by Two Stacks [http://www.lintcode.com/en/problem/implement-queue-by-two-stacks/] > As the title described, you should only use two stacks to implement a queue's actions. > The queue should support push(element), pop() and top() where pop is pop the first(a.k.a front) element in the

Implement Stack by Two Queues

LintCode-494.Implement Stack by Two Queues [http://www.lintcode.com/en/problem/implement-stack-by-two-queues/] > Implement a stack by two queues. The queue is first in first out (FIFO). That means you can not directly pop the last element in a queue. For this question, you need to pay attention to the