Stack
boolean b = stack.empty();
peek();
pop();
push();
Queue
Queue<Integer> q = new LinkedList<>();
q.add(i);
q.peek();
q.size();
q.remove();
boolean b = stack.empty();
peek();
pop();
push();
Queue<Integer> q = new LinkedList<>();
q.add(i);
q.peek();
q.size();
q.remove();
本文标题:Stack & Queue
本文链接:https://www.haomeiwen.com/subject/zgrsdctx.html
网友评论