Java LinkedList offerFirst(E) Method

Description

The Java LinkedList offerFirst(E e) method inserts the specified element E at the front of this linkedList. It is similar to addFirst() method.

Declaration

Following is the declaration for java.util.LinkedList.offerFirst() method

public boolean offerFirst(E e)

Parameters

e − The element to be added at the front.

Return Value

This method returns true if the element was added to this linkedList, else false.

Exception

NullPointerException − if the specified element is null.

Inserting an Element to the Start of the LinkedList of Integers Example

The following example shows the usage of Java LinkedList offerFirst(E) method. In this example, we're using integers. As first, we'll add some items to the linkedList using add() method and then using offerFirst() method, we'll add elements to the front of the linkedList. Then we're adding more elements using add() method again and the print the array to check if insertions in the linkedList are in the order we desired.

package com.tutorialspoint;

import java.util.LinkedList;

public class LinkedListDemo {
   public static void main(String[] args) {
      
      // create an empty linkedList
      LinkedList<Integer> linkedList = new LinkedList<>();

      // use add() method to add elements in the linkedList
      linkedList.add(4);
      linkedList.add(5);
      linkedList.add(6);

      // use offerFirst() method to add element at the front of the linkedList
      linkedList.offerFirst(3);
      linkedList.offerFirst(2);
      linkedList.offerFirst(1);//now, element 1 will be at the front

      // these elements will be added in continuation with linkedList.add(6)
      linkedList.add(7);
      linkedList.add(8);

      // let us print all the elements available in linkedList
      System.out.println("LinkedList = " + linkedList);
   }
}

Output

Let us compile and run the above program, this will produce the following result −

LinkedList = [1, 2, 3, 4, 5, 6, 7, 8]

Inserting an Element to the Start of the LinkedList of Strings Example

The following example shows the usage of Java LinkedList offerFirst(E) method. In this example, we're using strings. As first, we'll add some items to the linkedList using add() method and then using offerFirst() method, we'll add elements to the front of the linkedList. Then we're adding more elements using add() method again and the print the array to check if insertions in the linkedList are in the order we desired.

package com.tutorialspoint;

import java.util.LinkedList;

public class LinkedListDemo {
   public static void main(String[] args) {
      
      // create an empty linkedList
      LinkedList<String> linkedList = new LinkedList<>();

      // use add() method to add elements in the linkedList
      linkedList.add("D");
      linkedList.add("E");
      linkedList.add("F");

      // use offerFirst() method to add element at the front of the linkedList
      linkedList.offerFirst("C");
      linkedList.offerFirst("B");
      linkedList.offerFirst("A");//now, element A will be at the front

      // these elements will be added in continuation with linkedList.add("F")
      linkedList.add("G");
      linkedList.add("H");

      // let us print all the elements available in linkedList
      System.out.println("LinkedList = " + linkedList);
   }
}

Output

Let us compile and run the above program, this will produce the following result −

LinkedList = [A, B, C, D, E, F, G, H]

Inserting an Element to the Start of the LinkedList of Objects Example

The following example shows the usage of Java LinkedList offerFirst(E) method. In this example, we're using Student objects. As first, we'll add some items to the linkedList using add() method and then using offerFirst() method, we'll add elements to the front of the linkedList. Then we're adding more elements using add() method again and the print the array to check if insertions in the linkedList are in the order we desired.

package com.tutorialspoint;

import java.util.LinkedList;

public class LinkedListDemo {
   public static void main(String[] args) {

      // create an empty linkedList
      LinkedList<Student> linkedList = new LinkedList<>();

      // use add() method to add elements in the linkedList
      linkedList.add(new Student(4, "Julie"));
      linkedList.add(new Student(5, "Robert"));
      linkedList.add(new Student(6, "Adam"));

      // use offerFirst() method to add element at the front of the linkedList
      linkedList.offerFirst(new Student(3, "Rohan"));
      linkedList.offerFirst(new Student(2, "Sohan"));
      linkedList.offerFirst(new Student(1, "Mohan"));//now, Student 1 will be at the front

      // these elments will be added in continuation with linkedList.add(new Student(6, "Adam"))
      linkedList.add(new Student(7, "Ali"));
      linkedList.add(new Student(8, "Ahmad"));

      // let us print all the elements available in linkedList
      System.out.println("LinkedList = " + linkedList);      
   }
}

class Student {
   int rollNo;
   String name;

   Student(int rollNo, String name){
      this.rollNo = rollNo;
      this.name = name;
   }

   @Override
   public String toString() {
      return "[ " + this.rollNo + ", " + this.name + " ]";
   }
}

Output

Let us compile and run the above program, this will produce the following result −

LinkedList = [[ 1, Mohan ], [ 2, Sohan ], [ 3, Rohan ], [ 4, Julie ], [ 5, Robert ], [ 6, Adam ], [ 7, Ali ], [ 8, Ahmad ]]
java_util_linkedlist.htm
Advertisements