Merge pull request #115 from fusunx/master

添加 0090 子集问题II Javascript

problems/0090.子集II.md

@@ -219,7 +219,6 @@ func subsetsWithDup(nums []int)[][]int {
 	dfs([]int{},nums,0)
 	return res
 }
-
 func dfs(temp, num []int, start int)  {
 	tmp:=make([]int,len(temp))
 	copy(tmp,temp)
@@ -237,6 +236,37 @@ func dfs(temp, num []int, start int)  {
 ```
 
 
+Javascript:
+
+```Javascript
+
+var subsetsWithDup = function(nums) {
+    let result = []
+    let path = []
+    let sortNums = nums.sort((a, b) => {
+        return a - b
+    })
+    function backtracing(startIndex, sortNums) {
+        result.push(path.slice(0))
+        if(startIndex > nums.length - 1) {
+            return
+        }
+        for(let i = startIndex; i < nums.length; i++) {
+            if(i > startIndex && nums[i] === nums[i - 1]) {
+                continue
+            }
+            path.push(nums[i])
+            backtracing(i + 1, sortNums)
+            path.pop()
+        }
+    }
+    backtracing(0, sortNums)
+    return result
+};
+
+```
+
+
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)