java中LinkedList实现了Queue接口,可以当作队列使用
- 添加元素:
offer
或add
方法,add
方法在失败的时候会抛出异常(不推荐) - 删除元素:
remove
和poll
方法都是从队列中删除第一个元素。remove
失败时会抛出异常,poll
失败时只是返回null - 获取第一个元素:
peak
或poll
都能获得队首元素,peak
不删除,poll
返回后并删除
package test;
import java.util.LinkedList;
import java.util.Queue;
public class main {
public static void main(String[] args) {
Queue<Integer> queue = new LinkedList<Integer>();
// add element
queue.offer(11);
queue.offer(22);
queue.offer(33);
for (int e : queue)
System.out.print(e + " ");
System.out.println();
// get first value and remove it
System.out.println("get first value " + queue.poll() + " and remove it");
for (int e : queue)
System.out.print(e + " ");
System.out.println();
// get first value and don't remove it
System.out.println("get first value " + queue.peek() + " and don't remove it");
for (int e : queue)
System.out.print(e + " ");
System.out.println();
}
}