java实现单项、双向、循环链表

    @Test
    public void test3(){
        int[] data=new int[]{3,2,3,7,9,6};
        Node node;
        Node head;
        int size=1;
        if(data.length>0){
             node=new Node(data[0]);
             head=node;  //链表头结点
             for (int i = 1; i < data.length; i++) {
                Node nodes=new Node(data[i]);
                nodes.pre=node;
                node.next=nodes;
                node=node.next;
                size++;
                //尾部接头部，实现循环链表
                if(i==data.length-1){
                    node.next=head;
                    head.pre=node;
                }
            }
        }else head=new Node(null);  //数据为空则链表为null
        if(data.length==0){
            System.out.println(head.val);//数据为空则返回为空链表
        }else{
        for (int i = 0; i <data.length; i++) {
            System.out.println("第"+(i+1)+"个值为:"+head.val);
            head=head.next;
        }
        }
    }
 
    //链表结点类
    class Node<T>{
        T val;
        Node next;
        Node pre;
        public Node(T val,Node next){
            this.val=val;
            this.next=next;
        }
        public Node(T val){
            this.val=val;
            this.next=null;
        }
    }