剑指 Offer 09. 用两个栈实现队列 (golang版)

• 描述

用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )

示例 1：

输入：
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出：[null,null,3,-1]
示例 2：

输入：
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出：[null,-1,null,null,5,2]
提示：

1 <= values <= 10000
最多会对 appendTail、deleteHead 进行 10000 次调用

• 思路
  用两个切片模拟栈，一个入栈in，一个出栈out，出栈时检查out是否为空，若为空则将in栈中所有元素搬运到out栈中继续操作，若不为空直接从out出栈即可

• 解题

type CQueue struct {
	//栈in负责输入，栈out负责从头输出
	in []int
	out []int
}

func Constructor() CQueue {
	return CQueue{
		make([]int,0,5),
		make([]int,0,5),
	}
}

func (this *CQueue) AppendTail(value int)  {
	this.in = append(this.in[:], value)
}

func (this *CQueue) DeleteHead() int {
	if len(this.out) == 0 && len(this.in) == 0 {
		return -1
	}else if len(this.out) == 0 && len(this.in) > 0 {
		l := len(this.in) - 1
		for len(this.in) > 0 {
			val := this.in[l]
			this.in = this.in[:l]
			l--
			this.out = append(this.out,val)
		}
	}
	r := this.out[len(this.out) - 1]
	this.out = this.out[:len(this.out) - 1]
	return r
}

/**
 * Your CQueue object will be instantiated and called as such:
 * obj := Constructor();
 * obj.AppendTail(value);
 * param_2 := obj.DeleteHead();
 */

• 完整版

package main

import (
	"fmt"
)


func main() {
	obj := Constructor()
	obj.AppendTail(3)

	param_2 := obj.DeleteHead()
	fmt.Println(param_2)

	param_2 = obj.DeleteHead()
	fmt.Println(param_2)

	param_2 = obj.DeleteHead()
	fmt.Println(param_2)

}
type CQueue struct {
	//栈in负责输入，栈out负责从头输出
	in []int
	out []int
}
func Constructor() CQueue {
	return CQueue{
		make([]int,0,5),
		make([]int,0,5),
	}
}

func (this *CQueue) AppendTail(value int)  {
	this.in = append(this.in[:], value)
}

func (this *CQueue) DeleteHead() int {
	if len(this.out) == 0 && len(this.in) == 0 {
		return -1
	}else if len(this.out) == 0 && len(this.in) > 0 {
		l := len(this.in) - 1
		for len(this.in) > 0 {
			val := this.in[l]
			this.in = this.in[:l]
			l--
			this.out = append(this.out,val)
		}
	}
	r := this.out[len(this.out) - 1]
	this.out = this.out[:len(this.out) - 1]
	return r
}

/**
 * Your CQueue object will be instantiated and called as such:
 * obj := Constructor();
 * obj.AppendTail(value);
 * param_2 := obj.DeleteHead();
 */