problem0622

package
v0.0.0-...-d3fc627 Latest Latest
Warning

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

Go to latest
Published: Feb 15, 2020 License: MIT Imports: 0 Imported by: 0

README

622. Design Circular Queue

题目

Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".

One of the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the space to store new values.

Your implementation should support following operations:

  • MyCircularQueue(k): Constructor, set the size of the queue to be k.
  • Front: Get the front item from the queue. If the queue is empty, return -1.
  • Rear: Get the last item from the queue. If the queue is empty, return -1.
  • enQueue(value): Insert an element into the circular queue. Return true if the operation is successful.
  • deQueue(): Delete an element from the circular queue. Return true if the operation is successful.
  • isEmpty(): Checks whether the circular queue is empty or not.
  • isFull(): Checks whether the circular queue is full or not.

Example:

MyCircularQueue circularQueue = new MycircularQueue(3); // set the size to be 3
circularQueue.enQueue(1); // return true
circularQueue.enQueue(2); // return true
circularQueue.enQueue(3); // return true
circularQueue.enQueue(4); // return false, the queue is full
circularQueue.Rear(); // return 3
circularQueue.isFull(); // return true
circularQueue.deQueue(); // return true
circularQueue.enQueue(4); // return true
circularQueue.Rear(); // return 4

Note:

  1. All values will be in the range of [0, 1000].
  2. The number of operations will be in the range of[1, 1000].
  3. Please do not use the built-in Queue library.

解题思路

见程序注释

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type MyCircularQueue

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

MyCircularQueue 结构体

func Constructor

func Constructor(k int) MyCircularQueue

Constructor initialize your data structure here. Set the size of the queue to be k.

func (*MyCircularQueue) DeQueue

func (m *MyCircularQueue) DeQueue() bool

DeQueue delete an element from the circular queue. Return true if the operation is successful.

func (*MyCircularQueue) EnQueue

func (m *MyCircularQueue) EnQueue(value int) bool

EnQueue insert an element into the circular queue. Return true if the operation is successful.

func (*MyCircularQueue) Front

func (m *MyCircularQueue) Front() int

Front get the front item from the queue.

func (*MyCircularQueue) IsEmpty

func (m *MyCircularQueue) IsEmpty() bool

IsEmpty checks whether the circular queue is empty or not. */

func (*MyCircularQueue) IsFull

func (m *MyCircularQueue) IsFull() bool

IsFull checks whether the circular queue is full or not. */

func (*MyCircularQueue) Rear

func (m *MyCircularQueue) Rear() int

Rear get the last item from the queue. */

Jump to

Keyboard shortcuts

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