队列接口的offer(E e)方法在不违反容量限制的情况下可以立即将指定的元素插入此队列。此方法优于add()方法，因为在容器的容量已满时，此方法不会引发异常，因为它会返回false冷艳的睫毛膏/p> boolean offer(E e) 参数：此方法接受强制参数e，该参数是要插入队列中的元素冷艳的睫毛膏/p> 返回：成功插入时此方法返回true，否则返回false冷艳的睫毛膏/p> 异常：该函数引发四个异常，如下所述： ClassCastException：当要输入的元素的类阻止将其添加到此容器中时： IllegalArgumentException：当元素的某些属性阻止将其添加到队列中时： NullPointerException：当要插入的元素作为null传递并且Queue的接口不允许使用null元素时冷艳的睫毛膏/p> 以下示例程序旨在说明offer()队列方法： // Java Program Demonstrate offer() // method of Queue import java.util.*; import java.util.concurrent.LinkedBlockingQueue; public class GFG { public static void main(String危机的季节 args) throws zddpy/p> { // create object of Queue Queue fnddx/p> = new LinkedBlockingQueue(3); if (Q.offer(10)) else if (Q.offer(15)) else if (Q.offer(25)) else if (Q.offer(20)) else // before removing print Queue } } The Queue is not full and 10 is inserted The Queue is not full and 15 is inserted The Queue is not full and 25 is inserted The Queue is full Queue:[10, 15, 25] // Java Program Demonstrate offer() // method of Queue import java.util.*; import java.util.concurrent.ConcurrentLinkedDeque; public class GFG { public static void main(String危机的季节 args) throws zddpy/p> { // create object of Queue Queue fnddx/p> = new ConcurrentLinkedDeque(); if (Q.offer(10)) else if (Q.offer(15)) else if (Q.offer(25)) else if (Q.offer(20)) else // before removing print Queue } } The Queue is not full and 10 is inserted The Queue is not full and 15 is inserted The Queue is not full and 25 is inserted The Queue is not full and 20 is inserted Queue:[10, 15, 25, 20] // Java Program Demonstrate offer() // method of Queue import java.util.*; public class GFG { public static void main(String危机的季节 args) throws zddpy/p> { // create object of Queue Queue fnddx/p> = new ArrayDeque(6); if (Q.offer(10)) else if (Q.offer(15)) else if (Q.offer(25)) else if (Q.offer(20)) else // before removing print Queue } } The Queue is not full and 10 is inserted The Queue is not full and 15 is inserted The Queue is not full and 25 is inserted The Queue is not full and 20 is inserted Queue:[10, 15, 25, 20] // Java Program Demonstrate offer() // method of Queue import java.util.*; public class GFG { public static void main(String危机的季节 args) throws zddpy/p> { // create object of Queue Queue fnddx/p> = new LinkedList(); if (Q.offer(10)) else if (Q.offer(15)) else if (Q.offer(25)) else if (Q.offer(20)) else // before removing print Queue } } The Queue is not full and 10 is inserted The Queue is not full and 15 is inserted The Queue is not full and 25 is inserted The Queue is not full and 20 is inserted Queue:[10, 15, 25, 20] 以下示例程序旨在说明此方法引发的异常： // Java Program Demonstrate offer() // method of Queue when Null is passed import java.util.*; import java.util.concurrent.LinkedBlockingQueue; public class GFG { public static void main(String危机的季节 args) throws 天真的手链/p> { // create object of Queue Queue fnddx/p> = new LinkedBlockingQueue(); // Add numbers to end of Deque Q.offer(7855642); Q.offer(35658786); Q.offer(5278367); try { // when null is inserted Q.offer(null); } catch (Exception e) { } } } Exception:java.lang.天真的手链/p> 注意：其他两个异常是内部的，它们是由编译器引起的，因此无法在代码中显示冷艳的睫毛膏/p>