栈:先进后出
package com.ffyc.javaCollection;
import java.util.LinkedList;
public class MyStack {
/*
栈---先进后出
*/
LinkedList<String> list = new LinkedList<>();
public boolean add(String e){
list.addLast(e);
return true;
}
public String get(){
return list.removeLast();
}
public static void main(String[] args) {
MyStack mystack = new MyStack();
mystack.add("a");
mystack.add("b");
System.out.println(mystack.get());
}
}
队列:先进先出
package com.ffyc.javaCollection;
import java.util.LinkedList;
public class MyQueue {
/*
队列--先进先出
*/
LinkedList<String> list = new LinkedList<>();
public boolean add(String e){
list.addLast(e);
return true;
}
public String get(){
return list.removeFirst();
}
public static void main(String[] args) {
MyQueue myqueue = new MyQueue();
myqueue.add("a");
myqueue.add("b");
myqueue.add("c");
System.out.println(myqueue.get());
}
}