原理
一、HashMap解析原理
1、基础概念
public static void main(String[] args) {
//快速排序
}
总结:
1、hashMap的扩容机制
2、HashMap的装载因子为什么是0.75?
2、用2个栈实现队列
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/
public class CQueue {
Stack<Integer> stack1, stack2;
public CQueue() {
stack1 = new Stack<>();
stack2 = new Stack<>();
}
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
if (stack2.isEmpty()) {
if (stack1.isEmpty()) {
return -1;
}
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
}
return stack2.pop();
}