剑指 Offer 09. 用两个栈实现队列

112 阅读1分钟

一起养成写作习惯!这是我参与「掘金日新计划 · 4 月更文挑战」的第1天,点击查看活动详情

原题地址

剑指 Offer 09. 用两个栈实现队列

难度简单491

用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 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栈取, 如果没有元素的话, 就将IN栈的元素从栈顶开始push到OUT栈, 然后在从OUT栈出, 即实现了先入先出. 代码如下:

class CQueue {


    private Stack<Integer> in;
    private Stack<Integer> out;

    public CQueue() {
        in = new Stack<>();
        out = new Stack<>();
    }

    public void appendTail(int value) {
        in.push(value);
    }

    public int deleteHead() {
        if (out.empty()) {
            while (!in.empty()) {
                out.push(in.pop());
            }
        }
        if (out.empty()) {
            return -1;
        }
        return out.pop();
    }
}

/**
 * Your CQueue object will be instantiated and called as such:
 * CQueue obj = new CQueue();
 * obj.appendTail(value);
 * int param_2 = obj.deleteHead();
 */
type CQueue struct {
	Out Stack
	In  Stack
}

func Constructor() CQueue {
	return CQueue{
		Out: NewStack(),
		In:  NewStack(),
	}
}

func (c *CQueue) AppendTail(value int) {
	c.In.Push(value)
}

func (c *CQueue) DeleteHead() int {
	if !c.Out.Empty() {
		return c.Out.Pop()
	} else {
		for !c.In.Empty() {
			c.Out.Push(c.In.Pop())
		}
	}
	return c.Out.Pop()
}

// Stack 栈
type Stack struct {
	Values []int
}

// NewStack 栈 构造函数
func NewStack() Stack {
	return Stack{Values: make([]int, 0, 5)}
}

// Push 进
func (s *Stack) Push(val int) {
	s.Values = append(s.Values, val)
}

// Pop 出
func (s *Stack) Pop() int {
	values := s.Values
	if s.Empty() {
		return -1
	}
	length := len(values)
	result := values[length-1]
	s.Values = values[:length-1]
	return result
}

func (s *Stack) Peek() int {
	if s.Empty() {
		return -1
	}
	return s.Values[len(s.Values)-1]
}

func (s *Stack) Empty() bool {
	return s.Values == nil || len(s.Values) == 0
}



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