Commit eafcfca

committed

add 90

1 parent f9d4c1c commit eafcfcaCopy full SHA for eafcfca

File tree

+50

-0

lines changed

+50

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+`
	`2`	`+# 0090.subsets-ii`
	`3`	`+`
	`4`	+```text
	`5`	`+90. 子集 II`
	`6`	`+`
	`7`	`+给你一个整数数组 nums ,其中可能包含重复元素,请你返回该数组所有可能的子集(幂集)。`
	`8`	`+`
	`9`	`+解集不能包含重复的子集。返回的解集中,子集可以按任意顺序排列。`
	`10`	`+`
	`11`	`+`
	`12`	`+`
	`13`	`+示例 1:`
	`14`	`+`
	`15`	`+输入:nums = [1,2,2]`
	`16`	`+输出:[[],[1],[1,2],[1,2,2],[2],[2,2]]`
	`17`	`+示例 2:`
	`18`	`+`
	`19`	`+输入:nums = [0]`
	`20`	`+输出:[[],[0]]`
	`21`	`+`
	`22`	`+`
	`23`	`+提示:`
	`24`	`+`
	`25`	`+1 <= nums.length <= 10`
	`26`	`+-10 <= nums[i] <= 10`
	`27`	`+`
	`28`	`+来源:力扣(LeetCode)`
	`29`	`+链接:https://leetcode-cn.com/problems/subsets-ii`
	`30`	`+著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。`
	`31`	+```

Lines changed: 11 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,11 @@`
	`1`	`+package ii`
	`2`	`+`
	`3`	`+func Run() {`
	`4`	`+`
	`5`	`+}`
	`6`	`+`
	`7`	`+func subsetsWithDup(nums []int) [][]int {`
	`8`	`+ res := make([][]int, 0)`
	`9`	`+`
	`10`	`+ return res`
	`11`	`+}`

Lines changed: 8 additions & 0 deletions

Comments

(0)