剑指offer 用两个栈实现队列 Java

一、题目描述

用两个栈来实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型。

二、代码

import java.util.Stack;

public class Solution {
    Stack<Integer> stack1 = new Stack<Integer>();
    Stack<Integer> stack2 = new Stack<Integer>();
    int temp,result=0;
    public void push(int node) {
       stack1.push(node);
    }
    
    public int pop() {
        while(!stack1.empty()){
            temp=stack1.pop();
            stack2.push(temp);
        }
        
        result = stack2.pop();
        
        while(!stack2.empty()){
            temp=stack2.pop();
            stack1.push(temp);
        }
        
        return result;
    }
}

Kotlin ver.

class CQueue() {

    val stack1 = Stack<Int>()
    val stack2 = Stack<Int>()


    fun appendTail(value: Int) {
        stack1.push(value)
    }

    fun deleteHead(): Int {
        if(stack2.isNotEmpty())
            return stack2.pop()
        else{
            while(stack1.isNotEmpty())
                stack2.push(stack1.pop())
            if(stack2.isNotEmpty())
                return stack2.pop()
            else return -1
        }
    }

}

/**
 * Your CQueue object will be instantiated and called as such:
 * var obj = CQueue()
 * obj.appendTail(value)
 * var param_2 = obj.deleteHead()
 */

三、合集

在这里~