1. 232. 用栈实现队列
使用栈实现队列的下列操作:
push(x) -- 将一个元素放入队列的尾部。
pop() -- 从队列首部移除元素。
peek() -- 返回队列首部的元素。
empty() -- 返回队列是否为空。
示例:
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // 返回 1
queue.pop(); // 返回 1
queue.empty(); // 返回 false
说明:
你只能使用标准的栈操作 -- 也就是只有 push to top, peek/pop from top, size, 和 is empty 操作是合法的。
你所使用的语言也许不支持栈。你可以使用 list 或者 deque(双端队列)来模拟一个栈,只要是标准的栈操作即可。
假设所有操作都是有效的 (例如,一个空的队列不会调用 pop 或者 peek 操作)。
方法1:使用1个切片
type MyQueue struct {
stack []int
length int
}
/** Initialize your data structure here. */
func Constructor() MyQueue {
return MyQueue{
stack: make([]int,0),
}
}
/** Push element x to the back of queue. */
func (this *MyQueue) Push(x int) {
if this == nil{
return
}
this.stack = append(this.stack, x)
this.length++
}
/** Removes the element from in front of queue and returns that element. */
func (this *MyQueue) Pop() int {
if this == nil || this.length == 0 {
return 0
}
result := this.stack[0]
this.stack = this.stack[1:]
this.length--
return result
}
/** Get the front element. */
func (this *MyQueue) Peek() int {
if this == nil || this.length == 0 {
return 0
}
return this.stack[0]
}
/** Returns whether the queue is empty. */
func (this *MyQueue) Empty() bool {
if this == nil || this.length == 0{
return true
}
return false
}
/**
* Your MyQueue 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();
*/
方法2:使用2个切片
type MyQueue struct {
inStack []int
outStack []int
inLength int
outLength int
}
/** Initialize your data structure here. */
func Constructor() MyQueue {
return MyQueue{
inStack: make([]int,0),
outStack: make([]int,0),
}
}
/** Push element x to the back of queue. */
func (this *MyQueue) Push(x int) {
if this == nil{
return
}
this.inStack = append(this.inStack, x)
this.inLength++
}
/** Removes the element from in front of queue and returns that element. */
func (this *MyQueue) Pop() int {
if this == nil || (this.inLength == 0 && this.outLength== 0) {
return 0
}
if this.outLength ==0 {
for this.inLength !=0 {
this.outStack = append(this.outStack, this.inStack[this.inLength-1])
this.inLength--
this.outLength++
}
}else{
length := this.inLength
for this.inLength !=0 {
this.outStack = append([]int{this.inStack[length-this.inLength ]}, this.outStack...)
this.inLength--
this.outLength++
}
}
result := this.outStack[this.outLength-1]
this.outStack = this.outStack[:this.outLength-1]
this.inStack = []int{}
this.outLength--
return result
}
/** Get the front element. */
func (this *MyQueue) Peek() int {
if this == nil || (this.inLength == 0 && this.outLength == 0){
return 0
}
if this.outLength != 0{
return this.outStack[this.outLength-1]
}else{
return this.inStack[0]
}
}
/** Returns whether the queue is empty. */
func (this *MyQueue) Empty() bool {
if this == nil || (this.inLength == 0 && this.outLength == 0){
return true
}
return false
}
/**
* Your MyQueue 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();
*/
2. 225. 用队列实现栈
使用队列实现栈的下列操作:
push(x) -- 元素 x 入栈
pop() -- 移除栈顶元素
top() -- 获取栈顶元素
empty() -- 返回栈是否为空
注意:
你只能使用队列的基本操作-- 也就是 push to back, peek/pop from front, size, 和 is empty 这些操作是合法的。
你所使用的语言也许不支持队列。 你可以使用 list 或者 deque(双端队列)来模拟一个队列 , 只要是标准的队列操作即可。
你可以假设所有操作都是有效的(例如, 对一个空的栈不会调用 pop 或者 top 操作)。
1. 方法1,使用一个切片搞定
type MyStack struct {
queue []int
length int
}
/** Initialize your data structure here. */
func Constructor() MyStack {
return MyStack{queue:make([]int,0)}
}
/** Push element x onto stack. */
func (this *MyStack) Push(x int) {
if this == nil {
return
}
this.queue = append(this.queue,x)
this.length++
}
/** Removes the element on top of the stack and returns that element. */
func (this *MyStack) Pop() int {
if this == nil {
return 0
}
result := this.queue[this.length-1]
this.queue = this.queue[:this.length-1]
this.length--
return result
}
/** Get the top element. */
func (this *MyStack) Top() int {
if this == nil || this.length ==0 {
return 0
}
return this.queue[this.length-1]
}
/** Returns whether the stack is empty. */
func (this *MyStack) Empty() bool {
if this == nil || this.length ==0 {
return true
}
return false
}
/**
* Your MyStack object will be instantiated and called as such:
* obj := Constructor();
* obj.Push(x);
* param_2 := obj.Pop();
* param_3 := obj.Top();
* param_4 := obj.Empty();
*/