动态规划 C++数据结构 01 背包问题

#include <iostream>
using namespace std;
struct Item{
  int weight;
  int value;
};
void KnapSack(Item items[],int N,int capacity){//N个物品，背包容量为capacity
    int ans[N][capacity+1];
  for(int i=0;i<N;i++){
      for(int j=0;j<capacity+1;j++)
      {
          if(i==0||j==0){
              if(j<items[i].weight)
                  ans[i][j]=0;
              else
                  ans[i][j]=items[i].value;
          }
          else{
              if(j<items[i].weight)
                  ans[i][j]=ans[i-1][j];
              else
                  ans[i][j]=ans[i-1][j]>ans[i-1][j-items[i].weight]+items[i].value?ans[i-1][j]:ans[i-1][j-items[i].weight]+items[i].value;
          }

      }
  }
  for(int i=0;i<N;i++){
      for(int j=0;j<capacity+1;j++){
          cout<<ans[i][j]<<" ";
      }
      cout<<endl;
  }

}

int main() {
    int N=5;
    Item item[N];
 int w[]={2, 4, 3, 6, 4};
 int v[]={3, 5, 3, 8, 6};
 for(int i=0;i<5;i++){
   item[i].weight=w[i];
   item[i].value=v[i];
 }
KnapSack(item,5,10);



}

参考博文：https://blog.csdn.net/dala_da/article/details/79264394