题解 | #用两个栈实现队列#

package main

var stack1 []int
var stack2 []int

func Push(node int) {
	stack1 = append(stack1, node)
}

func Pop() int {
	if len(stack2) == 0 {
		for i := len(stack1) - 1; i >= 0; i-- {
			stack2 = append(stack2, stack1[i])
		}
		stack1 = []int{}
	}

	ret := stack2[len(stack2)-1]
	stack2 = stack2[:len(stack2)-1]

	return ret
}