Monday, November 18, 2024
Google search engine
HomeLanguagesJavaArrayDeque pollLast() Method in Java

ArrayDeque pollLast() Method in Java

The java.util.ArrayDeque.pollLast() method in Java is used to retrieve or fetch and remove the last element of the Deque. The peekLast() method only retrieved the element at the end but the pollLast() also removes the element along with the retrieval. It returns NULL if the deque is empty.

Syntax:

Array_Deque.pollLast()

Parameters: The method does not take any parameter.

Return Value: The method removes the last element of the Deque and returns the same. It returns NULL if the deque is empty.

Below programs illustrate the Java.util.ArrayDeque.pollLast() method:
Program 1:




// Java code to illustrate pollLast()
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("ArrayDeque: " + de_que);
  
        // Displaying the last element
        System.out.println("The last element is: " +
                                    de_que.pollLast());
  
        // Displaying the final ArrayDeque
        System.out.println("ArrayDeque after operation: "
                                                + de_que);
    }
}


Output:

ArrayDeque: [Welcome, To, Geeks, 4, Geeks]
The last element is: Geeks
ArrayDeque after operation: [Welcome, To, Geeks, 4]

Program 2:




// Java code to illustrate pollLast()
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("ArrayDeque: " + de_que);
  
        // Displaying the last element
        System.out.println("The element at head is: " +
                                       de_que.pollLast());
  
        // Displaying the final ArrayDeque
        System.out.println("ArrayDeque after operation: "
                                                + de_que);
    }
}


Output:

ArrayDeque: [10, 15, 30, 20, 5]
The element at head is: 5
ArrayDeque after operation: [10, 15, 30, 20]

Program 3: For an empty deque:




// Java code to illustrate pollLast()
import java.util.*;
  
public class ArrayDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ArrayDeque
        Deque<Integer> de_que = new ArrayDeque<Integer>();
  
        // Displaying the ArrayDeque
        System.out.println("ArrayDeque: " + de_que);
  
        // Displaying the last element
        System.out.println("The element at head is: " +
                                       de_que.pollLast());
    }
}


Output:

ArrayDeque: []
The element at head is: null
Dominic Rubhabha-Wardslaus
Dominic Rubhabha-Wardslaushttp://wardslaus.com
infosec,malicious & dos attacks generator, boot rom exploit philanthropist , wild hacker , game developer,
RELATED ARTICLES

Most Popular

Recent Comments