递归01背包算法Java_Java-01背包问题-动态规划-递归和非递归实现

国际惯例，先上代码，粗略分析：

package com.bag;

/**

* Author: lihao

* Date：2017/8/31

* Description:

*/

public class Main {

static int totalweight= 150;

static int N= 5;

static int values[] = {60, 20, 10, 60, 100};

static int weights[] = {20, 30, 50, 60, 80};

public static void main(String[] args) {

System.out.println(bagProblem(N-1,totalweight));

bag01();

}

//递归实现

// i {处理到第i件物品} , j{剩余的空间为j}

public static int bagProblem(int i, int j) {

int r = 0;

if(i==-1){

return 0;

}

//如果剩余空间大于所放的物品

if (j>=weights[i]){

int r1 = bagProblem(i-1,j-weights[i]) + values[i]; //放第i件

int r2 = bagProblem(i-1,j);//不放第i件

r = Math.max(r