单链表之Java实现

初次接触java，用java也写了一个链表。代码如下：

import java.io.*;

class Node{
    public int data; //数据域
    public Node next; //指针域，全局变量可以不用初始化
    public Node(int data1){
        data = data1;
        next = null;
    }
    
    public void display(){
        System.out.println("data: "+this.data);
    }
}


//定义单链表
class LinkList{
    public int pos = 0; //结点的位置
    public Node first; //头结点
    public LinkList(){
        Node first1 = new Node(0);
        first = first1;
    }
    
    
    //插入结点(从尾部插入结点)
    public void addNode(int data){
        if(first == null){
            Node node = new Node(data);
            first = node;
            node.next = null;
        }
        else{
            Node node = new Node(data);
            Node current = first;
            while(current.next != null)
                current = current.next;
            current.next = node;
            node.next = null;
        }
    }
    
    //删除尾部的结点
    public Node deleteNode(){
        Node current = first; 
        Node pre = current;
        while(current.next != null){
            pre = current;
            current = current.next;
        }
        Node temp = pre.next;
        pre.next = null;
        return temp;
    }
    
    //在任意位置插入节点
    public void insertNode(int index,int data){
        Node node = new Node(data);
        Node current = first;
        while(pos != (index-1)){
            current = current.next;
            pos++;
        }
        node.next = current.next;
        current.next = node;
        pos = 0;
    }
    
    //删除任意位置的结点
    public Node deleteNode(int index){
        Node current = first;
        while(pos != (index-1)){
            current = current.next;
            pos++;
        }
        Node temp = current.next;
        current.next = (current.next).next;
        pos = 0;
        return temp;
    }
    
    //显示出所有结点信息
    public void displayAllNodes(){
        Node current = first;
        while(current.next != null){
            current.display();
            current = current.next;
        }
    }
    
    //根据位置查找结点信息
    public Node findByPos(int index){
        Node current = first;
        while(pos != index){
            current = current.next;
            pos++;
        }
        pos = 0;
        return current;
    }
    
    //根据数据查找结点信息
    public Node findByData(int data){
        Node current = first;
        while(current.data != data){
            if(current.next == null)
                return null;
            current = current.next;
            }
        return current;
    }
    
}

public class test{
    public static void main(String[] args){
        LinkList link = new LinkList();
        link.addNode(1);
        link.addNode(2);
        link.addNode(3);
        link.addNode(4);
        link.addNode(5);
        link.insertNode(1,1000);
        link.displayAllNodes();
    }
}

下面是运行结果：

如有错误，欢迎交流指正。