Java队列(Queue) 小结

发表于:2010-7-05 10:34

字体: | 上一篇 | 下一篇 | 我要投稿

 作者:未知    来源:51Testing软件测试网采编

#
java

  有关java队列(Queue)小总结

  队列是先进先出(FIFO)

  1.入队列offer(obj);
  2.出队列poll();
  3.增加一元素add(obj);
  4.增加一集合add(c);
  5.读头元素peek()orelement()
  6.取队列长度size();
  7.清队列clear()

  参考代码如下:

  Java代码

packagecom.queue;
importjava.util.ArrayList;
importjava.util.Collection;
importjava.util.LinkedList;
importjava.util.Queue;
publicclassQueueTest{
  privatestaticQueue<String>q=newLinkedList<String>();
  /**
  *@paramargs
  */
  publicstaticvoidmain(String[]args){
    Stringa[]=newString[]  {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"};
    Collection<String>c=newArrayList<String>();
    c.add("1");
    c.add("2");
    c.add("3");

    //Puttingtheelementintoqueue
    for(inti=0;i<a.length;i++){
      q.offer(a[i]);
    }

    //Gettingtheheadelementofqueue
    System.out.println(q.peek());
    System.out.println(q.element());
    q.add("0");
    q.addAll(c);

    //Gettingthesizeofqueue
    System.out.println(q.size());

    //Poptheelement
    while(q.size()>0){
      System.out.print(q.poll()+",");
    }

    //Removeallelementofqueue
    q.clear();
  }
}

《2023软件测试行业现状调查报告》独家发布~

关注51Testing

联系我们

快捷面板 站点地图 联系我们 广告服务 关于我们 站长统计 发展历程

法律顾问:上海兰迪律师事务所 项棋律师
版权所有 上海博为峰软件技术股份有限公司 Copyright©51testing.com 2003-2024
投诉及意见反馈:webmaster@51testing.com; 业务联系:service@51testing.com 021-64471599-8017

沪ICP备05003035号

沪公网安备 31010102002173号