This program demonstrates operations on linked lists

   


/*
   This program is a part of the companion code for Core Java 8th ed.
   (http://horstmann.com/corejava)

   This program is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;

/**
 * This program demonstrates operations on linked lists.
 * @version 1.10 2004-08-02
 * @author Cay Horstmann
 */
public class LinkedListTest
{
   public static void main(String[] args)
   {
      List<String> a = new LinkedList<String>();
      a.add("Amy");
      a.add("Carl");
      a.add("Erica");

      List<String> b = new LinkedList<String>();
      b.add("Bob");
      b.add("Doug");
      b.add("Frances");
      b.add("Gloria");

      // merge the words from b into a

      ListIterator<String> aIter = a.listIterator();
      Iterator<String> bIter = b.iterator();

      while (bIter.hasNext())
      {
         if (aIter.hasNext()) aIter.next();
         aIter.add(bIter.next());
      }

      System.out.println(a);

      // remove every second word from b

      bIter = b.iterator();
      while (bIter.hasNext())
      {
         bIter.next(); // skip one element
         if (bIter.hasNext())
         {
            bIter.next(); // skip next element
            bIter.remove(); // remove that element
         }
      }

      System.out.println(b);

      // bulk operation: remove all words in b from a

      a.removeAll(b);

      System.out.println(a);
   }
}

Related examples in the same category

1.	Use for each loop to go through elements in a linkedlist
2.	Use addFirst method to add value to the first position in a linked list
3.	To insert an object into a specific position into the list, specify the index in the add method
4.	Updating LinkedList Items
5.	Convert LinkedList to Array with zero length array
6.	Convert LinkedList to Array with full length array
7.	Checking what item is first in line without removing it: element
8.	Removing the first item from the queue: poll
9.	Convert a LinkedList to ArrayList
10.	Add elements at beginning and end of LinkedList Java example
11.	Check if a particular element exists in LinkedList Java example
12.	Create an object array from elements of LinkedList Java example
13.	Get elements from LinkedList Java example
14.	Get first and last elements from LinkedList Java example
15.	Get SubList from LinkedList Java example
16.	Iterate through elements of Java LinkedList using Iterator example
17.	Remove all elements or clear LinkedList Java example
18.	Iterate through elements of Java LinkedList using ListIterator example
19.	Remove first and last elements of LinkedList Java example
20.	Remove range of elements from LinkedList Java example
21.	Remove specified element from LinkedList Java example
22.	Replace an Element of LinkedList Java example
23.	Search elements of LinkedList Java example
24.	Add or insert an element to ArrayList using Java ListIterator Example
25.	Finding an Element in a Sorted List
26.	Create a list with an ordered list of strings
27.	Search for a non-existent element
28.	Use an Iterator to cycle through a collection in the forward direction.
29.	Implementing a Queue with LinkedList
30.	Implementing a Stack
31.	Using a LinkedList in multi-thread
32.	Convert Collection to ArrayList
33.	Wrap queue to synchronize the methods
34.	Making a stack from a LinkedList
35.	Single linked list
36.	Double LinkedList
37.	Doubly Linked list
38.	A class for you to extend when you want object to maintain a doubly linked list
39.	A simple Doubly Linked list class, designed to avoid O(n) behaviour on insert and delete.
40.	A List helper class that attempts to avoid unneccessary List creation.
41.	Simple linked list class which uses a Comparator to sort the nodes.
42.	This implementation of LinkedList that is optimized for element removal.

This program demonstrates operations on linked lists : Link List « Collections Data Structure « Java

Related examples in the same category