qq_29494693的博客

题目题源代码class MinStack { private Deque<Integer> stack; private Deque<Integer> miniStack; /** initialize your data structure here. */ public MinStack() { stack = new LinkedList<Integer>(); miniStack = new

题目代码官方代码class MaxQueue { Queue<Integer> q; Deque<Integer> d; public MaxQueue() { q = new LinkedList<Integer>(); d = new LinkedList<Integer>(); } public int max_value() { if (d.isE

题目题源代码class MyQueue { private int front; Stack<Integer> s1; Stack<Integer> s2; /** Initialize your data structure here. */ public MyQueue() { s1 = new Stack<Integer>(); s2 = new Stack<Integer&g