今天主要是对栈和队列的认识还算是简单,但是我更喜欢用ArrayList(),ArrayList()可以任意位置取元素比起来是要方便不少,但是栈和队列也有自己的好处吧只是我还不够熟练,当时期末课设的迷宫鼠用的算法就需要用到栈但是我选择了用ArrayList()效果差不多。
● 232.用栈实现队列
// class MyQueue {//用ArrayList<Integer> 真的方便;
// ArrayList<Integer> list;
// public MyQueue() {
// list= new ArrayList<>();
// }
// public void push(int x) {
// list.add(x);
// }
// public int pop() {
// return list.remove(0);
// }
// public int peek() {
// return list.get(0);
// }
// public boolean empty() {
// return list.isEmpty();
// }
// }
class MyQueue {
Stack<Integer> in;
Stack<Integer> out;
public MyQueue() {
in=new Stack<>();
out=new Stack<>();
}
public void push(int x) {
in.push(x);
}
public int pop() {
move();
return out.pop();
}
public int peek() {
move();
return out.peek();
}
public boolean empty() {
return out.empty()&&in.empty();
}
public void move() {
if(!out.empty()) return;
while(!in.empty()) {
out.push(in.pop());
}
}
}
/**
* Your MyQueue object will be instantiated and called as such:
* MyQueue obj = new MyQueue();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.peek();
* boolean param_4 = obj.empty();
*/
● 225. 用队列实现栈
class MyStack {
Queue<Integer> in;
Queue<Integer> out;
public MyStack() {
in=new LinkedList<>();
out=new LinkedList<>();
}
public void push(int x) {
while(out.size()>0) {
in.offer(out.poll());
}
out.offer(x);
while(in.size()>0) {
out.offer(in.poll());
}
}
public int pop() {
return out.poll();
}
public int top() {
return out.peek();
}
public boolean empty() {
return out.isEmpty();
}
}
/**
* Your MyStack object will be instantiated and called as such:
* MyStack obj = new MyStack();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.top();
* boolean param_4 = obj.empty();
*/
记录
第10天轻松结束,再接再厉,朋友们商量穷游不知道会不会落下进度啊。