单链表的java实现

class LNode
{
    public LNode next;
    public int data;
}
class Lianbiao
{
    private static LNode head = new LNode();;
    private static LNode node;
    private static LNode tail;
    private static int index;
    public static void main(String[] args){
        int[] nums = {1,2,3,4,5,6,7,8,9,10}; 
        head.data = nums[0];
        tail = head;
        createLine(nums);
        printLine();
    }

    private static void createLine(int[] nums){
        while (index<10)
        {
            node = new LNode();
            tail.next = node;
            node.data = nums[index];
            node.next = null;
            tail = node;
            index ++;
            
        }
    }

    private static void printLine(){
        node = head;
        while(node!=null&&node.next!=null){
            node = node.next;
            System.out.println(node.data);
        }
    }
}