算法day32-动态规划（5）完全背包问题
目录[*]完全背包理论
[*]零钱兑换II
[*]组合总和IV
[*]爬楼梯（进阶）
一、完全背包理论
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int bagWeight = scanner.nextInt(); int[] weight = new int; int[] value = new int; for (int i = 0; i < n; i++) { weight = scanner.nextInt(); value = scanner.nextInt(); } int[][] dp = new int; // 初始化 for (int j = weight; j
页:
[1]