lcqueue.java

算法中一个经典问题：背包问题的优先队列算法实现。

public class lcQueue {
    int id;
    int flag;
    int pri,sumvalue;
    int sumweigh;
    resultNode ptr;
    lcQueue  next;

    public lcQueue(int id_,int flag_,int pri_,int sumvalue_,int sumweigh_) {
        id=id_;
        flag=flag_;
        pri=pri_;
        sumvalue=sumvalue_;
        sumweigh=sumweigh_;
    }
    public lcQueue()
    {
        id=flag=sumweigh=sumvalue=0;
        next=null;
        ptr=null;
    }
}