链表的java实现

 
public class Node {
    //存放数据
    private int date;
    //指向下一个节点个引用
    private Node next;

    public int getDate() {
        return date;
    }

    public void setDate(int date) {
        this.date = date;
    }

    public Node getNext() {
        return next;
    }

    public void setNext(Node next) {
        this.next = next;
    }
}
public class MyLinkList {

    private Node head=new Node();
    private Node tail=head;
    //定义存放数据方法
    public void add(int num){
        //创建一个节点,将数据填充到节点,将尾部节点指向新创建的节点
        Node node=new Node();
        //将数据填充节点
        node.setDate(num);
        
       // Node next=tail.getNext();
       tail.setNext(node);
        tail=node;
    }
    //定义get方法
    public int get(int index){
        Node target=head;
        for (int i = 0; i < index+1; i++) {
            target=target.getNext();
        }
        return target.getDate();
    }

    public static void main(String[] args) {
        MyLinkList myLinkList = new MyLinkList();
        for (int i = 0; i < 100; i++) {
            myLinkList.add(i);
        }
        System.out.println(myLinkList.get(1));
    }
}


 

猜你喜欢

转载自blog.csdn.net/qq_38384971/article/details/81036781