78 accepted

Author: aQua

Algorithms/0078.subsets/README.md

@@ -22,4 +22,5 @@ If nums = [1,2,3], a solution is:
 ```
 ## 解题思路
 
+
 见程序注释

Algorithms/0078.subsets/subsets.go

@@ -1,5 +1,9 @@
 package Problem0078
 
+import (
+	"sort"
+)
+
 func subsets(nums []int) [][]int {
 	res := [][]int{}
 
@@ -9,13 +13,14 @@ func subsets(nums []int) [][]int {
 }
 
 func cur(nums, temp []int, res *[][]int) {
-	if len(nums) == 0 {
+	l := len(nums)
+	if l == 0 {
+		sort.Ints(temp)
 		*res = append(*res, temp)
 		return
 	}
 
-	cur(nums[1:], temp, res)
-
-	cur(nums[1:], append(temp, nums[0]), res)
+	cur(nums[:l-1], temp, res)
 
+	cur(nums[:l-1], append([]int{nums[l-1]}, temp...), res)
 }

Algorithms/0078.subsets/subsets_test.go

@@ -33,16 +33,56 @@ func Test_Problem0078(t *testing.T) {
 			},
 			ans{[][]int{
 				[]int{},
-				[]int{3},
-				[]int{2},
-				[]int{2, 3},
 				[]int{1},
-				[]int{1, 3},
+				[]int{2},
 				[]int{1, 2},
+				[]int{3},
+				[]int{1, 3},
+				[]int{2, 3},
 				[]int{1, 2, 3},
 			}},
 		},
 
+		question{
+			para{
+				[]int{9,0,3,5,7},
+			},
+			ans{[][]int{
+				[]int{},
+				[]int{9},
+				[]int{0},
+				[]int{0,9},
+				[]int{3},
+				[]int{3,9},
+				[]int{0,3},
+				[]int{0,3,9},
+				[]int{5},
+				[]int{5,9},
+				[]int{0,5},
+				[]int{0,5,9},
+				[]int{3,5},
+				[]int{3,5,9},
+				[]int{0,3,5},
+				[]int{0,3,5,9},
+				[]int{7},
+				[]int{7,9},
+				[]int{0,7},
+				[]int{0,7,9},
+				[]int{3,7},
+				[]int{3,7,9},
+				[]int{0,3,7},
+				[]int{0,3,7,9},
+				[]int{5,7},
+				[]int{5,7,9},
+				[]int{0,5,7},
+				[]int{0,5,7,9},
+				[]int{3,5,7},
+				[]int{3,5,7,9},
+				[]int{0,3,5,7},
+				[]int{0,3,5,7,9},
+			}},
+		},
+
 		// 如需多个测试，可以复制上方元素。
 	}