stack-to-queue.go

package stack

import "fmt"

type Queue struct {
	queue []interface{}
}

/** Initialize your data structure here. */
func ConstructorQueue() Queue {

	return Queue{
		queue: []interface{}{},
	}
}

/** Push element x to the back of queue. */
func (this *Queue) Push(x interface{}) {
	this.queue = append(this.queue, x)
}

/** Removes the element from in front of queue and returns that element. */
func (this *Queue) Pop() interface{} {

	size := len(this.queue)

	if size == 0 {
		return nil
	} else {
		res := this.queue[0]
		this.queue = append([]interface{}{}, this.queue[1:]...)
		return res
	}
}

/** Get the front element. */
func (this *Queue) Peek() interface{} {
	size := len(this.queue)
	if size == 0 {
		return nil
	} else {
		return this.queue[0]
	}
}

/** Returns whether the queue is empty. */
func (this *Queue) Empty() bool {

	if len(this.queue) == 0 {
		return true
	} else {
		return false
	}
}

/**
 * Your Queue object will be instantiated and called as such:
 * obj := Constructor();
 * obj.Push(x);
 * param_2 := obj.Pop();
 * param_3 := obj.Peek();
 * param_4 := obj.Empty();
 */

func testQueue() {
	obj := ConstructorQueue()
	obj.Push("12")
	param_2 := obj.Pop()
	param_3 := obj.Peek()
	param_4 := obj.Empty()

	fmt.Println(param_2)
	fmt.Println(param_3)
	fmt.Println(param_4)
}