一.队列 (先进先出)
1.push(和栈一样的list操作)
public static void push(ArrayList<String> list, String str){
list.add(str);
}
2.poll (和栈相反,队列是第一个元素先出队列)
public static String poll(ArrayList<String> list) throws Exception{
if (list.size()==0){
throw new Exception("队列为空, 不可pop !!!");
}
return list.remove(0);
}
3.Test
public static void main(String[] args) throws Exception {
//队列 (先进先出)
ArrayList<String> list_queue = new ArrayList<>();
push(list_queue, "Poetic");
push(list_queue, "Dream");
push(list_queue, "Sprite");
System.out.println(list_queue);
System.out.println("出队:" + poll(list_queue));
System.out.println(list_queue);
System.out.println("出队:" + poll(list_queue));
System.out.println(list_queue);
System.out.println("出队:" + poll(list_queue));
//异常
// System.out.println("出队:" + poll(list_queue));
}
异常处理