leetcode四道组合总和题目的DP求解（39+40+216+377）

这四道题目相似，只是有不同的区别，这里记录一下这四道题目的DP解法。
leetcode39：Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]
Example 2:

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]
python代码如下：

def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
		cache = [[] for _ in range(target + 1)]
        cache[0] = [[]]
        for c in candidates:
            for i in range(target + 1):
                if i >= c:
                    for temp_ans