Update 40.combination-sum-ii.md

problems/40.combination-sum-ii.md

@@ -47,7 +47,7 @@ A solution set is:
 
 我们先来看下通用解法的解题思路，我画了一张图：
 
-![backtrack](../assets/problems/backtrack.png)
+![](https://tva1.sinaimg.cn/large/007S8ZIlly1gfyrnqi82ej31190u0e81.jpg)
 
 通用写法的具体代码见下方代码区。
 
@@ -62,57 +62,6 @@ A solution set is:
 * 语言支持: Javascript，Python3
 
 ```js
-/*
- * @lc app=leetcode id=40 lang=javascript
- *
- * [40] Combination Sum II
- *
- * https://leetcode.com/problems/combination-sum-ii/description/
- *
- * algorithms
- * Medium (40.31%)
- * Total Accepted:    212.8K
- * Total Submissions: 519K
- * Testcase Example:  '[10,1,2,7,6,1,5]\n8'
- *
- * Given a collection of candidate numbers (candidates) and a target number
- * (target), find all unique combinations in candidates where the candidate
- * numbers sums to target.
- * 
- * Each number in candidates may only be used once in the combination.
- * 
- * Note:
- * 
- * 
- * All numbers (including target) will be positive integers.
- * The solution set must not contain duplicate combinations.
- * 
- * 
- * Example 1:
- * 
- * 
- * Input: candidates = [10,1,2,7,6,1,5], target = 8,
- * A solution set is:
- * [
- * ⁠ [1, 7],
- * ⁠ [1, 2, 5],
- * ⁠ [2, 6],
- * ⁠ [1, 1, 6]
- * ]
- * 
- * 
- * Example 2:
- * 
- * 
- * Input: candidates = [2,5,2,1,2], target = 5,
- * A solution set is:
- * [
- * [1,2,2],
- * [5]
- * ]
- * 
- * 
- */
 function backtrack(list, tempList, nums, remain, start) {
     if (remain < 0) return;
     else if (remain === 0) return list.push([...tempList]);