0-1 Knapsack proble

package Three;

public class KNAPSACK {
    public static int [][]  KNAPSACK_DP(int[] v,int [] w,int W) 
    {
        int n=w.length-1;
        int[][] c=new int[n+1][W+1];
        for(int j=0;j<=W;j++)
        {
            c [0][j]=0;
        }
        for(int i=0;i<=n;i++)
        {
            c[i][0]=0;
        }
        for(int i=1;i<=n;i++){//前i个物品
            for(int j=1;j<=W;j++)
            {
                //if(w[i]<=W)
                //{
                    if(w[i]<=j)//当前最大容量为j
                    {
                        if(v[i]+c[i-1][j-w[i]]>c[i-1][j])
                            c[i][j]=v[i]+c[i-1][j-w[i]];
                        else c[i][j]=c[i-1][j];    
                    }
                //}
                else c[i][j]=c[i-1][j];        
            }
        }
        return c;//[n][W];
    }
    public static void PrintArray(int [][] array,int W)
    { 
        int n=array.length-1;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=W;j++){
                System.out.print(array[i][j]+" ");
            }
            System.out.println();
        }
        System.out.println();
        System.out.println("the biggist value is "+array[n][W]);
        
    }
    public static void main(String[] args)
    {
        int [] weight={0,1,2,5,6,7};//考虑到28行有c[i-1]，在前面添一个0元素
        int [] value={0,1,6,18,22,28};
        int[][] c=KNAPSACK_DP(value,weight,11);
        //System.out.println("the biggist value is "+v);
        PrintArray(c,11);
    }

}