Merge branch 'master' of https://github.com/youngyangyang04/leetcode

problems/0090.子集II.md

@@ -211,7 +211,30 @@ Python：
 
 
 Go：
+```Go
+var res[][]int
+func subsetsWithDup(nums []int)[][]int {
+	res=make([][]int,0)
+	 sort.Ints(nums)
+	dfs([]int{},nums,0)
+	return res
+}
 
+func dfs(temp, num []int, start int)  {
+	tmp:=make([]int,len(temp))
+	copy(tmp,temp)
+
+	res=append(res,tmp)
+	for i:=start;i<len(num);i++{
+		if i>start&&num[i]==num[i-1]{
+			continue
+		}
+		temp=append(temp,num[i])
+		dfs(temp,num,i+1)
+		temp=temp[:len(temp)-1]
+	}
+}
+```
 
 
 

problems/0226.翻转二叉树.md

@@ -207,7 +207,7 @@ Java：
 
 Python：
 
-
+Go：
 ```Go
 func invertTree(root *TreeNode) *TreeNode {
     if root ==nil{