java链表的增 删 改 查 (附代码)

来源:互联网 发布:李玮 靠谱网络 编辑:程序博客网 时间:2024/06/04 17:58

首先我们需要有个链节点的类 Link

package link;public class Link {   public int id;   public String value;    //指向下一个链借点  public Link next;    public Link(int id,String value) {        this.id = id;        this.value=value;    }    public  void display(){        System.out.println("id:"+id);    }}
现在新建一个链表类,包含增删改查的方法
package link;public class LinkList {    private Link first;    public LinkList() {        this.first = null;    }    //添加一个链接点    public void insertFirst(int id,String value) {        Link newLink = new Link(id,value);        /*        *   核心在与把首节点付给新节点的next        *   然后在把新节点设置为首节点        * */        newLink.next = first;        first = newLink;    }    //显示所有链接点    public void displayList() {        Link current = first;        while (current != null) {            current.display();            current = current.next;        }        System.out.println("");    }    //根据id删除一个链接点    public Link deleteLink(int id) {        //这个变量作用是用来遍历        Link current = first;        //这个变量的作用是存储当前节点        Link privious = first;        while (current.id != id) {            if (privious == null) {                return null;            } else {                current = current.next;            }        }        /*如果要删除的节点是首节点        则把当前节点设为null        * */        if (current == first) {            first = first.next;        } else {            //作用是存储            privious.next = first.next;        }        return current;    }    //根据id查找链节点    public Link find(int id) {        Link current = this.first;        while (current.id != id) {            if (current.next != null) {                current = current.next;            } else {                return null;            }        }        return current;    }}

原创粉丝点击