problem0232

package
v0.0.0-...-899dd15 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Sep 11, 2020 License: MIT Imports: 1 Imported by: 0

README

232. Implement Queue using Stacks

题目

Implement the following operations of a queue using stacks.

  • push(x) -- Push element x to the back of queue.
  • pop() -- Removes the element from in front of queue.
  • peek() -- Get the front element.
  • empty() -- Return whether the queue is empty.

Example:

MyQueue queue = new MyQueue();

queue.push(1);
queue.push(2);
queue.peek();  // returns 1
queue.pop();   // returns 1
queue.empty(); // returns false

Notes:

  • You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
  • Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
  • You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type MyQueue

type MyQueue struct {
	// contains filtered or unexported fields
}

MyQueue 是利用 list 实现的队列

func Constructor

func Constructor() MyQueue

Constructor Initialize your data structure here.

func (*MyQueue) Empty

func (q *MyQueue) Empty() bool

Empty returns whether the queue is empty.

func (*MyQueue) Peek

func (q *MyQueue) Peek() int

Peek Get the front element.

func (*MyQueue) Pop

func (q *MyQueue) Pop() int

Pop Removes the element from in front of queue and returns that element.

func (*MyQueue) Push

func (q *MyQueue) Push(x int)

Push element x to the back of queue.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL