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

用两个栈实现队列

https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6

using System.Collections.Generic;
class Solution {
    Stack<int> stack1 = new Stack<int>();
    Stack<int> stack2 = new Stack<int>();
    public void push(int node) {
        if (stack1.Count == 0 && stack2.Count == 0) {
            stack1.Push(node);
        } else if (stack1.Count != 0 && stack2.Count == 0) {
            stack2.Push(node);
        } else if (stack1.Count != 0 && stack2.Count != 0) {
            while (stack2.Count != 0) {
                stack1.Push(stack2.Pop());
            }
            stack2.Push(node);
            while (stack1.Count != 1) {
                stack2.Push(stack1.Pop());
            }
        } else if (stack1.Count == 0 && stack2.Count != 0) {
            stack1.Push(stack2.Pop());
            stack2.Push(node);
        }
    }
    public int pop() {
        if (stack1.Count != 0) return stack1.Pop();
        return stack2.Pop();
    }
}

#用两个栈实现队列#
全部评论

相关推荐

刷牛客的我很豁达:你是不是对算法有什么误解,你没手握两篇顶刊顶会,还想搞算法岗,有顶刊顶会在算法岗算才入门
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务