头插法与尾插法建立单链表

头插法与尾插法建立单链表

import java.util.*;
class Node {
    int value;
    Node next;
    Node(int x) {
        value = x;
    }
}
public class 一个单链表 {
    public static void main(String[] args) {
        List<Node> list = new LinkedList<>();
        for (int i = 0; i < 10; i++) {
            Node node = new Node(i + 1);
            list.add(node);
        }
        Node head = new Node(0);
        head.next = null;
        for (int i = 0; i < 10; i++) {
            list.get(i).next = head.next; // 头插法
            head.next = list.get(i);
        }
       /* Node rear = head;
        for (int i = 0; i < 10; i++) {
            rear.next = list.get(i); // 尾插法
            list.get(i).next = null;
            rear = list.get(i);
        }
        */
        Node dummy = head;
        while (dummy.next != null) {
            dummy = dummy.next;
            System.out.println(dummy.value);
        }
    }
}