链表（Java）

来源：互联网发布：联合培养博士知乎编辑：程序博客网时间：2024/06/05 20:46

转载请注明出处：http://blog.csdn.net/u011569040/article/details/48861035

该图片来源于博客：http://www.cnblogs.com/Johness/archive/2012/04/11/2443011.html

先构造节点对象Node

/* *链接点，相当于车厢 */public class Node {//数据域public long data;//指针域public Node next;public Node(long value){this.data = value;}/* *显示方法  */public void display(){System.out.print(data + " ");}}

再构造链表对象Linklist,现实方法删除插入：

/* *链表，相当于车头  */public class Linklist {//头结点private Node first;public Linklist(){first = null;}/* * 插入一个节点，在头结点后进行插入 */public void insertFirst(long value){Node node = new Node(value);node.next = first;first = node;}/* * 删除一个节点，在头结点后进行删除 */public Node deleteFirst(){Node tmp = first;first = tmp.next;return tmp;}/* * 显示方法 */public void display(){Node current = first;while(current != null){current.display();current = current.next;}System.out.println();}/* * 查找方法 */public Node find(long value){Node current = first;while(current.data != value){if(current.next ==  null){return null;}current = current.next;}return current;}/* * 删除方法，根据删除域来进行删除 */public Node delete(long value){Node current = first;Node previous = first;while(current.data != value){if(current.next == null){return null;}previous = current;current = current.next;}if(current == first){first = first.next;}else{previous.next = current.next;}return current;}}

测试：

public class TestLinkList {public static void main(String[] args) {Linklist linkList = new Linklist();linkList.insertFirst(34);linkList.insertFirst(23);linkList.insertFirst(12);linkList.insertFirst(-1);linkList.insertFirst(0);//linkList.display();////linkList.deleteFirst();//linkList.display();////Node a = linkList.find(12);//a.display();linkList.delete(34);linkList.display();}}

源码：http://download.csdn.net/detail/u011569040/9153393

0 0