摘要：
标签： 动态规划 描述： Given an integer array nums with all positive numbers and no duplicates, find the number of possible combinations that add up to a positi 阅读全文
摘要：
标签：动态规划 问题描述： Given n items with size Ai and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack? 解题思路： 又是一道恶 阅读全文