RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/arraydeque-offerlast-method-in-java/ below:

ArrayDeque offerLast() Method in Java

Last Updated : 11 Jul, 2025

The Java.util.ArrayDeque.offerLast(

Object element

) method in Java is used to add a specific element at the end of this Deque. The function is similar to the

addLast()

add()

and offer() method of ArrayDeque in Java.

Syntax:

Array_Deque.offerLast(Object element)

Parameters:

The parameter

element

is of the type ArrayDeque and refers to the element to be added at the end of the Deque.

Return Value:

The function returns True if the element is successfully added into the deque else it returns false.

Exceptions:

The method throws

NullPointerException

if the passed parameter is NULL. Below programs illustrate the Java.util.ArrayDeque.offerLast() method:

Program 1:

Adding String elements into the Deque.

Java


 // Java code to illustrate offerLast()
import java.util.*;

public class ArrayDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ArrayDeque
        Deque<String> de_que = new ArrayDeque<String>();

        // Use add() method to add elements into the Deque
        de_que.add("Welcome");
        de_que.add("To");
        de_que.add("Geeks");
        de_que.add("4");
        de_que.add("Geeks");

        // Displaying the ArrayDeque
        System.out.println("Initial Deque: " + de_que);

        // Using offerLast() to add elements
        de_que.offerLast("Hello");
        de_que.offerLast("World");

        // Displaying the ArrayDeque
        System.out.println("Final Deque: " + de_que);
    }
}

Output:

Initial Deque: [Welcome, To, Geeks, 4, Geeks]
Final Deque: [Welcome, To, Geeks, 4, Geeks, Hello, World]

Program 2:

Adding Integer elements into the Deque.

Java


 // Java code to illustrate offerLast()
import java.util.*;

public class ArrayDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ArrayDeque
        Deque<Integer> de_que = new ArrayDeque<Integer>();

        // Use add() method to add elements into the Deque
        de_que.add(10);
        de_que.add(15);
        de_que.add(30);
        de_que.add(20);
        de_que.add(5);

        // Displaying the ArrayDeque
        System.out.println("Initial Deque: " + de_que);

        // Using offerLast() to add elements
        de_que.offerLast(1658);
        de_que.offerLast(2458);

        // Displaying the ArrayDeque
        System.out.println("Final Deque: " + de_que);
    }
}

Output:

Initial Deque: [10, 15, 30, 20, 5]
Final Deque: [10, 15, 30, 20, 5, 1658, 2458]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4