背包问题

public class beg {
    public  static  final  int  N=7;
    public  static  final  int S=15;
    int w[]={0,1,4,3,4,5,2,7};
    boolean knap(int s,int n){
        if(s==0) return true;
        if(s<0||s>0&&n<1) return false;
        if(knap(s-w[n],n-1)){
            System.out.println(w[n]);
            return true;
        }
        return knap(s,n-1);
    }


    public static void main(String[] args) {
        beg b =new beg();
        b.knap(S,N);

    }

}

 

posted @ 2021-10-31 20:01  老运维  阅读(38)  评论(0)    收藏  举报