基于有序链表的优先级队例

public class Link {
    public long lData;
    public Link next;//reference to next Link

    public Link(long lData){
        this.lData=lData;
    }
    public void displayLink(){
        System.out.print(lData+" ");
    }
}
public class SortedList {
    private Link first;

    public SortedList(){
        first =null;
    }

    public boolean isEmpty(){
        return (first==null);
    }

    public void insert(long key){
        Link newLink = new Link(key);
        Link previous=null;
        Link current=first;
        while(current!=null&&key>current.lData){
            previous=current;
            current=current.next;
        }
        if(previous==null){
            first=newLink;
        }
        else{
            previous.next=newLink;
        }
        newLink.next=current;
    }

    public Link remove(){
        Link temp =first;
        first=first.next;
        return temp;
    }

    public void displayList(){
        Link current =first;
        while(current!=null){
            current.displayLink();
            current=current.next;
        }
        System.out.println("");
    }
}
/**
     * 优先级队列
     */
public class PriorityQ {
    private SortedList theSortedList;

    public PriorityQ(){
        theSortedList=new SortedList();
    }

    public void insert(long item){
        theSortedList.insert(item);
    }

    public long remove(){//remove minimum item
        return theSortedList.remove().lData;
    }


    public boolean isEmpty(){
        return theSortedList.isEmpty();
    }

    public void displayQueue(){
        theSortedList.displayList();
    }
}
public class PriorityQApp {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        PriorityQ thePQ = new PriorityQ();
        thePQ.insert(30);
        thePQ.insert(50);
        thePQ.insert(10);
        thePQ.insert(40);
        thePQ.insert(20);
        while(!thePQ.isEmpty()){
            long item = thePQ.remove();
            System.out.print(item+" ");
        }
    }
}
  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值