C#实现背包问题算法解题《一》

public class Knapsack 
{ 
            public static void Knapbag(int []val,int[] wt,int W) 
            { 
                 int N = wt.Length; 
                 int[,] V = new int[N + 1,W + 1]; 
                 for(int col=0;col<=W;col++) 
                     { V[0, col] = 0; } 
                 for (int row = 0; row <= N; row++) 
                  V[row, 0] = 0; 
                for(int item=1;item<=N;item++) 
                { 
                  for(int weight=1;weight<=W;weight++) 
                    { 
                         if (wt[item - 1] <= weight) 
                                 V[item, weight] = Math.Max(val[item - 1] + V[item - 1, weight - 
                                  wt[item -  1]], V[item - 1, weight]);  
                        else  
                                V[item, weight] = V[item - 1, weight]; 
                    } 
              } 
               for(int i=0;i<=N;i++) 
              { 
                    for(int j=0;j<=W;j++) 
                     { 
                        Console.Write("{0:000} ",V[i,j]); 
                      } 
                          Console.WriteLine(); 
              } // return V[N, W]; } 

}

 

转载于:https://my.oschina.net/u/2475253/blog/3097305