Merge pull request #844 from 0xff-dev/90

Add solution and test-cases for problem 90

Author: 6boris

leetcode/1-100/0090.Subsets-II/README.md

@@ -0,0 +1,28 @@
+# [90.Subsets II][title]
+
+## Description
+Given an integer array `nums` that may contain duplicates, return all possible 
+subsets (the power set).
+
+The solution set **must not** contain duplicate subsets. Return the solution in **any order**.
+
+**Example 1:**
+
+```
+Input: nums = [1,2,2]
+Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
+```
+
+**Example 2:**
+
+```
+Input: nums = [0]
+Output: [[],[0]]
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/subsets-ii
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/1-100/0090.Subsets-II/Solution.go

@@ -1,5 +1,58 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(nums []int) [][]int {
+	ans := [][]int{{}}
+	cache := make(map[[21]int]struct{})
+
+	var (
+		dfs   func(int, int, [21]int)
+		toRes func([21]int) []int
+	)
+
+	toRes = func(path [21]int) []int {
+		r := make([]int, 0)
+		for i := 0; i <= 10; i++ {
+			if path[i] == 0 {
+				continue
+			}
+			for count := path[i]; count > 0; count-- {
+				r = append(r, i)
+			}
+		}
+		for i := 11; i < 21; i++ {
+			if path[i] == 0 {
+				continue
+			}
+			for count := path[i]; count > 0; count-- {
+				r = append(r, 10-i)
+			}
+		}
+		return r
+	}
+
+	dfs = func(index, l int, path [21]int) {
+		if l == 0 {
+			if _, ok := cache[path]; !ok {
+				ans = append(ans, toRes(path))
+				cache[path] = struct{}{}
+			}
+			return
+		}
+		if index == len(nums) {
+			return
+		}
+		cur := nums[index]
+		if cur < 0 {
+			cur = 10 - cur
+		}
+		path[cur]++
+		dfs(index+1, l-1, path)
+		path[cur]--
+		dfs(index+1, l, path)
+	}
+	for l := 1; l <= len(nums); l++ {
+		dfs(0, l, [21]int{})
+	}
+
+	return ans
 }

leetcode/1-100/0090.Subsets-II/Solution_test.go

@@ -9,12 +9,13 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs []int
+		expect [][]int
 	}{
-		{"TestCacse 1", true, true},
-		{"TestCacse 1", true, true},
-		{"TestCacse 1", false, false},
+		{"TestCacse1", []int{1, 2, 2}, [][]int{
+			{}, {1}, {2}, {1, 2}, {2, 2}, {1, 2, 2},
+		}},
+		{"TestCacse2", []int{0}, [][]int{{}, {0}}},
 	}
 
 	//	开始测试
@@ -29,10 +30,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }