数据结构之链表的Java实现

下面是单链表的java实现。

package cn.zhf.list;
public class Link {
    public int idata;//存放int 类型的数据
    public double ddata;//double类型的数据
    public Link next;//对下一个Link对象的引用
    public Link(int id, double dd) {
        idata = id;
        ddata = dd;
    }
    public void diaplay() {
        System.out.println(idata + "," + ddata);
    }
}
 
public class LinkList {
    private Link first;
    public LinkList() {
        first = null;
    }
    public boolean isEmpty() {
        return (first == null);
    }
 
    //插入一个元素
    public void insertFirst(int id, double dd) {
        Link link = new Link(id, dd);
        link.next = first;//next元素链接first
        first = link;//first元素链接link
    }
    //删除一个元素
    public Link deleteFirst() {
        Link temp = first;
        first = first.next;
        return temp;
    }
    //显示链表的元素
    public void displayLink() {
        Link current = first;
        while (current != null) {
            current.diaplay();
            current = current.next;
        }
    }
    public static void main(String[] args) {
        LinkList list = new LinkList();
        list.insertFirst(12, 12.3);
        list.insertFirst(11, 12.4);
        list.insertFirst(14, 12.5);
        list.displayLink();
        while (!list.isEmpty()) {
            Link flink = list.deleteFirst();
            System.out.print("deleting -->");
            flink.diaplay();
        }
        list.displayLink();
    }
}

14,12.5
11,12.4
12,12.3
deleting -->14,12.5
deleting -->11,12.4
deleting -->12,12.3

数据结构之链表的Java实现,布布扣,bubuko.com

数据结构之链表的Java实现

原文：http://blog.csdn.net/laozhaokun/article/details/20527419