摘要：
课程中, 作者将DP的问题分成以下几类: 1. 0/1 Knapsack, 0/1背包，6个题 0/1 Knapsack，0/1背包问题 Equal Subset Sum Partition，相等子集划分问题 Subset Sum，子集和问题 Minimum Subset Sum Differenc 阅读全文
摘要：
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文