[E:69/533, M:69/974, H:6/387] add No: 78: Subsets

Author: gladmo

.leetcode.db

@@ -0,0 +1,20 @@
+## [子集](https://leetcode-cn.com/problems/subsets/)
+
+给定一组**不含重复元素**的整数数组 _nums_，返回该数组所有可能的子集（幂集）。
+
+**说明：**解集不能包含重复的子集。
+
+**示例:**
+
+`**输入:** nums = [1,2,3]
+**输出:**
+[
+ [3],
+  [1],
+  [2],
+  [1,2,3],
+  [1,3],
+  [2,3],
+  [1,2],
+  []
+]`

questions/serial/medium/78/README.md

@@ -0,0 +1,62 @@
+package main
+
+import (
+"context"
+"fmt"
+"reflect"
+"time"
+
+"github.com/gladmo/leetcode/questions/serial/medium/78/golang/solution"
+"github.com/gladmo/leetcode/leet"
+)
+
+func main() {
+/*
+ 
+[1,2,3]
+
+ */
+
+tests := []struct {
+name string
+input [][]int
+want bool
+}{
+{
+name: "test-[[1],[2],[3],[]]",
+input: [][]int{
+{1},
+{2},
+{3},
+{},
+},
+want: true,
+},
+}
+
+testLog := leet.NewTestLog(len(tests))
+defer testLog.Render()
+
+timeoutDuration := time.Second * 2
+
+for idx, test := range tests {
+// 超时检测
+got := test.want
+timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+got = solution.Export(test.input)
+cancel()
+})
+
+if timeout {
+testLog.Fail(idx+1, test.name, "timeout")
+continue
+}
+
+if !reflect.DeepEqual(test.want, got) {
+testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+continue
+}
+
+testLog.Pass(idx+1, test.name)
+}
+}

questions/serial/medium/78/golang/main.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+"fmt"
+"os"
+"runtime/debug"
+)
+
+func Export(nums []int) [][]int {
+defer func() {
+if r := recover(); r != nil {
+fmt.Println("Params: ", nums)
+fmt.Println("Panic:", r)
+fmt.Println()
+debug.PrintStack()
+os.Exit(0)
+}
+}()
+
+return subsets(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func subsets(nums []int) [][]int {
+
+}

questions/serial/medium/78/golang/solution/subsets.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+"fmt"
+"os"
+"runtime/debug"
+)
+
+func Export(nums []int) [][]int {
+defer func() {
+if r := recover(); r != nil {
+fmt.Println("Params: ", nums)
+fmt.Println("Panic:", r)
+fmt.Println()
+debug.PrintStack()
+os.Exit(0)
+}
+}()
+
+return subsets(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func subsets(nums []int) [][]int {
+
+}

questions/serial/medium/78/golang/solution/subsets.go.clean

@@ -0,0 +1,20 @@
+## [子集](https://leetcode-cn.com/problems/subsets/)
+
+给定一组**不含重复元素**的整数数组 _nums_，返回该数组所有可能的子集（幂集）。
+
+**说明：**解集不能包含重复的子集。
+
+**示例:**
+
+`**输入:** nums = [1,2,3]
+**输出:**
+[
+ [3],
+  [1],
+  [2],
+  [1,2,3],
+  [1,3],
+  [2,3],
+  [1,2],
+  []
+]`

questions/tags/位运算/medium/subsets/README.md

@@ -0,0 +1,62 @@
+package main
+
+import (
+"context"
+"fmt"
+"reflect"
+"time"
+
+"github.com/gladmo/leetcode/questions/tags/位运算/medium/subsets/golang/solution"
+"github.com/gladmo/leetcode/leet"
+)
+
+func main() {
+/*
+ 
+[1,2,3]
+
+ */
+
+tests := []struct {
+name string
+input [][]int
+want bool
+}{
+{
+name: "test-[[1],[2],[3],[]]",
+input: [][]int{
+{1},
+{2},
+{3},
+{},
+},
+want: true,
+},
+}
+
+testLog := leet.NewTestLog(len(tests))
+defer testLog.Render()
+
+timeoutDuration := time.Second * 2
+
+for idx, test := range tests {
+// 超时检测
+got := test.want
+timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+got = solution.Export(test.input)
+cancel()
+})
+
+if timeout {
+testLog.Fail(idx+1, test.name, "timeout")
+continue
+}
+
+if !reflect.DeepEqual(test.want, got) {
+testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+continue
+}
+
+testLog.Pass(idx+1, test.name)
+}
+}

questions/tags/位运算/medium/subsets/golang/main.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+"fmt"
+"os"
+"runtime/debug"
+)
+
+func Export(nums []int) [][]int {
+defer func() {
+if r := recover(); r != nil {
+fmt.Println("Params: ", nums)
+fmt.Println("Panic:", r)
+fmt.Println()
+debug.PrintStack()
+os.Exit(0)
+}
+}()
+
+return subsets(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func subsets(nums []int) [][]int {
+
+}

questions/tags/位运算/medium/subsets/golang/solution/subsets.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+"fmt"
+"os"
+"runtime/debug"
+)
+
+func Export(nums []int) [][]int {
+defer func() {
+if r := recover(); r != nil {
+fmt.Println("Params: ", nums)
+fmt.Println("Panic:", r)
+fmt.Println()
+debug.PrintStack()
+os.Exit(0)
+}
+}()
+
+return subsets(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func subsets(nums []int) [][]int {
+
+}

questions/tags/位运算/medium/subsets/golang/solution/subsets.go.clean

@@ -0,0 +1,20 @@
+## [子集](https://leetcode-cn.com/problems/subsets/)
+
+给定一组**不含重复元素**的整数数组 _nums_，返回该数组所有可能的子集（幂集）。
+
+**说明：**解集不能包含重复的子集。
+
+**示例:**
+
+`**输入:** nums = [1,2,3]
+**输出:**
+[
+ [3],
+  [1],
+  [2],
+  [1,2,3],
+  [1,3],
+  [2,3],
+  [1,2],
+  []
+]`