双向链表--数据结构和算法笔记

 注：有序添加、删除、修改、遍历

public class rrr {
    public static void main(String[] args) {

        DoublePLinkedList p = new DoublePLinkedList();
        p.add(new Nnode(3, "111"));
        p.add(new Nnode(2, "333"));
        p.add(new Nnode(5, "333"));
        p.add(new Nnode(1, "333"));
        p.del(2);
        p.set(3, "name");
        p.show(p.getHead());
    }
}

class DoublePLinkedList {
    Nnode head = new Nnode(0, "");
    // 添加
    public void add(Nnode nnode) {
        Nnode temp = head;
        while (temp.next != null) {
            // id 相同的不能添加
            if (temp.next.id == nnode.id) {
                System.out.println("添加失败");
                return;
            }
            // 按顺序添加
            if (temp.next.id > nnode.id) {
                nnode.next = temp.next;
                temp.next.pre = nnode;
                temp.next = nnode;
                nnode.pre = temp;
                return;
            }
            temp = temp.next;
        }
        temp.next = nnode;
        nnode.pre = temp;

    }

    // 遍历单链表
    public void show(Nnode node) {
        if (node.next == null) {
            System.out.println("为空");
            return;
        }
        Nnode temp = node.next;
        while (true) {
            System.out.println(temp);
            if (temp.next == null) {
                break;
            }
            temp = temp.next;
        }
    }

    // 修改
    public void set(int id, String name) {
        Nnode temp = head;
        try {
            while (temp.next.id != id) {
                temp = temp.next;
            }
            temp.next.name = name;

        } catch (Exception e) {
            // TODO: handle exception
            if (temp.next == null) {
                System.err.println("修改失败");
            }
        }
    }

    // 删除
    public void del(int id) {

        Nnode temp = head;
        try {
            while (temp.next.id != id) {
                temp = temp.next;
            }
            temp.next = temp.next.next;
            temp.next.pre = temp;

        } catch (Exception e) {
            // TODO: handle exception
            if (temp.next == null) {
                System.err.println("删除失败");
            }
        }
    }

    public Nnode getHead() {
        return head;
    }

}

class Nnode {
    public int id;
    public String name;
    public Nnode pre;
    public Nnode next;

    public Nnode(int id, String name) {
        this.id = id;
        this.name = name;
    }

    @Override
    public String toString() {
        return "Nnode [id=" + id + ", name=" + name + "]";
    }

}

输出：

Nnode [id=1, name=333]
Nnode [id=3, name=name]
Nnode [id=5, name=333]