单链表

public class Link {
    public int iData;//data
    public double dData;//data
    public Link next;//reference to next Link

    public Link(int iData,double dData){
        this.iData=iData;
        this.dData=dData;
    }
    public void displayLink(){
        System.out.print("{"+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 newLink = new Link(id,dd);
        newLink.next=first;
        first=newLink;
    }

    public Link deleteFirst(){
        Link temp = first;//save reference to link
        first = first.next;//delete it 
        return temp;
    }

    public void displayList(){
        Link current =first;
        while(current!=null){
            current.displayLink();
            current=current.next;
        }
        System.out.println("");
    }

    public Link find(int key){
        Link current=first;
        while(current.iData!=key){
            if(current.next==null){
                return null;
            }
            else{
                current =current.next;
            }
        }
        return current;
    }

    public Link delete(int key){
        Link current=first;
        Link previous=first;
        while(current.iData!=key){
            if(current.next==null){
                return null;
            }
            else{
                previous=current;
                current =current.next;
            }
        }
        if(current==first){
            first=first.next;
        }
        else{
            previous.next=current.next;
        }
        return current;
    }
}
public class LinkListApp {
    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        LinkList theList = new LinkList();
        theList.insertFirst(22, 2.99);
        theList.insertFirst(44, 4.99);
        theList.insertFirst(66, 6.99);
        theList.displayList();

        Link f = theList.find(22);
        if(f!=null){
            System.out.println("Found link with key:"+f.iData);
        }
        else{
            System.out.println("Can't find link");
        }

        Link d =theList.delete(22);
        if(d!=null){
            System.out.println("Delete link with key:"+d.iData);
        }
        else{
            System.out.println("Can't delete link");
        }

        while(!theList.isEmpty()){
            Link aLink = theList.deleteFirst();
            aLink.displayLink();
        }
        theList.displayList();
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值