Java 实现链表

在这篇文章中，我们将理解如何实现链表。java.util.LinkedList类的操作执行我们可以预期的双向链表操作。索引到列表的操作将从开头或末尾遍历列表，以靠近指定索引的位置为准。

以下是同样的演示 –

假设我们的输入是 –

Run the program

期望的输出将是 −

The elements of the linked list are:
100 150 200 250

步骤

Step 1 - START
Step 2 - Create a class with the required members.
Step 3 - Define an ‘insert’ function to add elements to the list.
Step 4 - In the ‘main’ method, create a new instance of the class.
Step 5 - Create a list, and add elements to it using the ‘insert’ method.
Step 6 - Iterate over the list, and display the value present in the current node.
Step 7 - Move on to the next node and perform the same operation.
Step 8 - Do this until the end of the list is reached.
Step 9 - Display the result
Step 10 - Stop

示例1

在这里，我们将所有的操作绑定在“main”函数下。

public class Demo {
   Node head;
   static class Node {
      int data;
      Node next_element;
      Node(int element){
         data = element;
         next_element = null;
      }
   }
   public static Demo insert(Demo input_list, int data){
      Node new_node = new Node(data);
      new_node.next_element = null;
      if (input_list.head == null) {
         input_list.head = new_node;
      }
      else {
         Node last = input_list.head;
         while (last.next_element != null) {
            last = last.next_element;
         }
         last.next_element = new_node;
      }
      return input_list;
   }
   public static void main(String[] args){
      Demo input_list = new Demo();
      System.out.print("A linked list is declared: \n");
      input_list = insert(input_list, 100);
      input_list = insert(input_list, 150);
      input_list = insert(input_list, 200);
      input_list = insert(input_list, 250);
      Node current_node = input_list.head;
      System.out.print("The elements of the linked list are: \n");
      while (current_node != null) {
         System.out.print(current_node.data + " ");
         current_node = current_node.next_element;
      }
   }
}

输出

A linked list is declared:
The elements of the linked list are:
100 150 200 250

示例2

在这里，我们将操作封装到展示面向对象编程的函数中。

public class Demo {
   Node head;
   static class Node {
      int data;
      Node next_element;
      Node(int element){
         data = element;
         next_element = null;
      }
   }
   public static Demo insert(Demo input_list, int data){
      Node new_node = new Node(data);
      new_node.next_element = null;
      if (input_list.head == null) {
         input_list.head = new_node;
      }
      else {
         Node last = input_list.head;
         while (last.next_element != null) {
            last = last.next_element;
         }
         last.next_element = new_node;
      }
      return input_list;
   }
   public static void print_list(Demo input_list){
      Node current_node = input_list.head;
      System.out.print("The elements of the linked list are: \n");
      while (current_node != null) {
         System.out.print(current_node.data + " ");
         current_node = current_node.next_element;
      }
   }
   public static void main(String[] args){
      Demo input_list = new Demo();
      System.out.print("A linked list is declared: \n");
      input_list = insert(input_list, 100);
      input_list = insert(input_list, 150);
      input_list = insert(input_list, 200);
      input_list = insert(input_list, 250);
      print_list(input_list);
   }
}

输出

A linked list is declared:
The elements of the linked list are:
100 150 200 250