LinkedLis实现队列和栈
纯手打,可能会有一些小错误,勿喷。
实现队列
public class Linked01 <E>{
private LinkedList<E> linked = new LinkedList<>();
public void offerElement(E element){
linked.offer(element);
}
public E pollElement(){
return linked.poll();
}
public boolean isEmpty(){
return !(linked == null || linked.size() == 0);
}
}
main方法
public class Linked01Test{
public static void main(String[] args){
Linked01<Integer> lin = new Linked01<>();
Scanner sc = new Scanner(System.in);
while(true){
System.out.print("请输入成绩:"):
int score = sc.nextInt();
if(score == -1){
break;
}
lin.offerElement(score);
}
while(lin.isEmpty()){
int score = lin.pollElement();
System.out.println("成绩是:" + score);
}
}
}
实现栈
public class Linked02<E>{
private LinkedList<E> linkde = new LinkedList<>();
public void offerElement(E element){
linked.offer(element);
}
public E pollElement(){
return linked.pollLast();
}
public boolean isEmpty(){
return !(linked == null || linked.size() == 0);
}
}
main方法
public class Linked02Test{
public static void main(String[] args){
Linked02<Integer> lin = new Linked02<>();
Scanner sc = new Scanner(System.in);
while(true){
System.out.print("请输入成绩:");
int score = sc.nextInt();
if(score == -1){
break;
}
lin.offerElement(score);
}
while(lin.isEmpty){
int score = lin.pollElement();
System.out.println("成绩是:" + score);
}
}
}