78 submit 后，发现答案的顺序可能不对

Author: aQua

Algorithms/0078.subsets/README.md

@@ -0,0 +1,25 @@
+# [78. Subsets](https://leetcode.com/problems/subsets/)
+
+## 题目
+Given a set of distinct integers, nums, return all possible subsets.
+
+Note: The solution set must not contain duplicate subsets.
+
+For example,
+If nums = [1,2,3], a solution is:
+
+```
+[
+  [3],
+  [1],
+  [2],
+  [1,2,3],
+  [1,3],
+  [2,3],
+  [1,2],
+  []
+]
+```
+## 解题思路
+
+见程序注释

Algorithms/0078.subsets/subsets.go

@@ -0,0 +1,21 @@
+package Problem0078
+
+func subsets(nums []int) [][]int {
+	res := [][]int{}
+
+	cur(nums, []int{}, &res)
+
+	return res
+}
+
+func cur(nums, temp []int, res *[][]int) {
+	if len(nums) == 0 {
+		*res = append(*res, temp)
+		return
+	}
+
+	cur(nums[1:], temp, res)
+
+	cur(nums[1:], append(temp, nums[0]), res)
+
+}

Algorithms/0078.subsets/subsets_test.go

@@ -0,0 +1,55 @@
+package Problem0078
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type question struct {
+	para
+	ans
+}
+
+// para 是参数
+type para struct {
+	nums []int
+}
+
+// ans 是答案
+type ans struct {
+	one [][]int
+}
+
+func Test_Problem0078(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+
+		question{
+			para{
+				[]int{1, 2, 3},
+			},
+			ans{[][]int{
+				[]int{},
+				[]int{3},
+				[]int{2},
+				[]int{2, 3},
+				[]int{1},
+				[]int{1, 3},
+				[]int{1, 2},
+				[]int{1, 2, 3},
+			}},
+		},
+
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	for _, q := range qs {
+		a, p := q.ans, q.para
+		fmt.Printf("~~%v~~\n", p)
+
+		ast.Equal(a.one, subsets(p.nums), "输入:%v", p)
+	}
+}