Java中的Queue remove()方法

这个 删除() 方法 队列接口 返回并删除容器前面的元素。它会删除容器的头部。该方法抛出了一个 非接触性异常 当队列为空时。

null

语法:

E remove()

返回: 此方法返回 排队等候。

例外情况: 函数抛出一个 非接触性异常 当队列为空时。

下面的程序演示了队列的remove()方法:

项目1: 借助于 链表 .

// Java Program Demonstrate remove()
// method of Queue
import java.util.*;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of Queue
Queue<Integer> Q
= new LinkedList<Integer>();
// Add numbers to end of Queue
Q.add( 7855642 );
Q.add( 35658786 );
Q.add( 5278367 );
Q.add( 74381793 );
// print queue
System.out.println( "Queue: " + Q);
// print head and deletes the head
System.out.println( "Queue's head: " + Q.remove());
// print head and deleted the head
System.out.println( "Queue's head: " + Q.remove());
}
}


输出:

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

项目2: 借助于 ArrayDeque .

// Java Program Demonstrate remove()
// method of Queue
import java.util.*;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of Queue
Queue<Integer> Q
= new ArrayDeque<Integer>();
// Add numbers to end of Queue
Q.add( 7855642 );
Q.add( 35658786 );
Q.add( 5278367 );
Q.add( 74381793 );
// print queue
System.out.println( "Queue: " + Q);
// print head and deletes the head
System.out.println( "Queue's head: " + Q.remove());
// print head and deleted the head
System.out.println( "Queue's head: " + Q.remove());
}
}


输出:

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

方案3: 借助于 LinkedBlockingDeque .

// Java Program Demonstrate remove()
// method of Queue
import java.util.*;
import java.util.concurrent.LinkedBlockingDeque;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of Queue
Queue<Integer> Q
= new LinkedBlockingDeque<Integer>();
// Add numbers to end of Queue
Q.add( 7855642 );
Q.add( 35658786 );
Q.add( 5278367 );
Q.add( 74381793 );
// print queue
System.out.println( "Queue: " + Q);
// print head and deletes the head
System.out.println( "Queue's head: " + Q.remove());
// print head and deleted the head
System.out.println( "Queue's head: " + Q.remove());
}
}


输出:

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

方案4: 借助于 ConcurrentLinkedEque .

// Java Program Demonstrate remove()
// method of Queue
import java.util.*;
import java.util.concurrent.ConcurrentLinkedDeque;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of Queue
Queue<Integer> Q
= new ConcurrentLinkedDeque<Integer>();
// Add numbers to end of Queue
Q.add( 7855642 );
Q.add( 35658786 );
Q.add( 5278367 );
Q.add( 74381793 );
// print queue
System.out.println( "Queue: " + Q);
// print head and deletes the head
System.out.println( "Queue's head: " + Q.remove());
// print head and deleted the head
System.out.println( "Queue's head: " + Q.remove());
}
}


输出:

Queue: [7855642, 35658786, 5278367, 74381793]
Queue's head: 7855642
Queue's head: 35658786

下面的程序举例说明 此方法引发的异常 :

方案5: 展示 非接触性异常 .

// Java Program Demonstrate remove()
// method of Queue
import java.util.*;
public class GFG {
public static void main(String[] args)
throws IllegalStateException
{
// create object of Queue
Queue<Integer> Q
= new LinkedList<Integer>();
// Add numbers to end of Queue
Q.add( 423 );
Q.add( 3432 );
// print queue
System.out.println( "Queue: " + Q);
// print head and deletes the head
System.out.println( "Queue's head: " + Q.remove());
// print head and deleted the head
System.out.println( "Queue's head: " + Q.remove());
// print queue
System.out.println( "Queue: " + Q);
try {
// Queue is empty now hence exception
System.out.println( "Queue's head: " + Q.element());
}
catch (Exception e) {
System.out.println( "Exception: " + e);
}
}
}


输出:

Queue: [423, 3432]
Queue's head: 423
Queue's head: 3432
Queue: []
Exception: java.util.NoSuchElementException

参考: https://docs.oracle.com/javase/8/docs/api/java/util/Queue.html#remove–

© 版权声明
THE END
喜欢就支持一下吧
点赞5 分享