双向链表的实现和测试(JAVA)

双向链表的实现

class Node{
    public Node next;
    public Node prey;
    public int data;

    public Node(int data){
        this.data = data;
    }
}

class DoubleList{
    public Node head;
    public Node last;
    public DoubleList(){
        this.head = null;
        this.last = null;
    }
    //头插法
    public void addFirst(int data){
        Node node = new Node(data);
        if(head == null){
            this.head = node;
            this.last = node;
        }else{
            head.prey = node;
            node.next = head;
            head =  node;
            head.prey = null;
        }
    }

    //尾插法
    public void addLast(int data){
        Node node = new Node(data);
        if(head == null){
            this.head = node;
            this.last = node;
        }else{
            last.next = node;
            node.prey = last;
            last = node;
        }
    }

    //任意位置插入,第一个数据节点为0号下标

    //检查index合法性
    private void checkIndex(int index){
        if(index < 0 || index > size()) {
            throw new IndexOutOfBoundsException("index越界异常");
        }
    }
    //找对应下标节点
    private Node foundIndex(int index){

        int count = 0;
        Node cur = this.head;
        while(count < index){
            count++;
            cur = cur.next;
        }
        return cur;
    }
    public boolean addIndex(int index,int data){
        //首先要找到对应下标节点并检查合法性,checkIndex();foundIndex();
        checkIndex(index);
        Node node = new Node(data);
        Node cur = foundIndex(index);
        if(cur == head){
            addFirst(data);
            return  true;
        }else if(cur == last){
            addLast(data);
        }
        node.next = cur;
        node.prey = cur.prey;
        cur.prey.next = node;
        cur.prey = node;
        return true;
    }

    //求双向链表长度
    public int size(){
        Node cur = this.head;
        int count = 0;
        if(head == null){
            return 0;
        }
        while(cur != null){
            cur = cur.next;
            count++;
        }
        return count;
    }
    //查找是否包含关键字key是否在双向链表当中
    public boolean contains(int key){
        Node cur = this.head;
        while(cur != null){
            if(cur.data == key){
                return true;
            }
            cur = cur.next;
        }
        return false;
    }
    //删除第一次出现关键字为key的节点
    public void remove(int key){
        Node cur = this.head;
        while(cur != null){
            //头结点
            if(cur.data == key && cur == head){
                head = head.next;
                head.prey = null;
                return ;
            }
            //尾节点
            else if(cur.data == key && cur == last){
                last = last.prey;
                last.next = null;
                return ;
            }
            //中间节点
            else if(cur.data == key){
                cur.prey.next = cur.next;
                cur.next.prey = cur.prey;
                return ;
            }
            cur = cur.next;
        }
    }
    //删除所有值为key的节点
    public void removeAllKey(int key){
        Node cur = this.head;
        while(cur != null){
            //头结点
            if(cur.data == key && cur == head){
                head = head.next;
                head.prey = null;
            }
            //尾节点
            else if(cur.data == key && cur == last){
                last = last.prey;
                last.next = null;
            }
            //中间节点
            else if(cur.data == key){
                cur.prey.next = cur.next;
                cur.next.prey = cur.prey;
            }
            cur = cur.next;
        }
    }
    //展示双向链表
    public void display(){
        Node cur = this.head;
        while(cur != null){
            System.out.print(cur.data+" ");
            cur = cur.next;
        }
        System.out.println();
    }
    //清空双向链表(不允出现内存泄漏)
    public void clear(){
        Node cur = this.head;

        while(cur != null){
            Node curNext = cur.next;
            cur.prey = null;
            cur.next = null;
            cur = curNext;
        }
        //防止内存泄漏
        this.head = null;
        this.last = null;
    }
}

测试

public class TestDamo{
    public static void main(String[] args) {
        DoubleList doubleList = new DoubleList();
        doubleList.addFirst(1); //头插
        doubleList.addFirst(2); //头插
        doubleList.addFirst(3); //头插
        doubleList.addFirst(4); //头插
        doubleList.addFirst(5); //头插
        doubleList.addFirst(6); //头插
        doubleList.addLast(3);  //尾插
        doubleList.display();
        System.out.println("长度:"+doubleList.size());
        doubleList.addIndex(2,10); //中间插
        doubleList.display();
        doubleList.remove(2);//删除第一次出现data为2的节点
        doubleList.display();
        doubleList.removeAllKey(3);//删除所有data为3的节点
        doubleList.display();
        System.out.println("========下面是清空双向链表");
        doubleList.clear();
        doubleList.display();
    }
}

测试结果

6 5 4 3 2 1 3
长度:7
6 5 10 4 3 2 1 3
6 5 10 4 3 1 3
6 5 10 4 1
========下面是清空双向链表

========上面是清空双向链表
发布了37 篇原创文章 · 获赞 5 · 访问量 2200
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 技术工厂 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览