update at 2017-10-23

bonfy · bonfy · commit 4208c9b99430 · 2017-10-23T12:28:34.000Z
diff --git a/078-subsets/subsets.py b/078-subsets/subsets.py
@@ -2,7 +2,7 @@
 
 
 #
-# Given a set of distinct integers, nums, return all possible subsets.
+# Given a set of distinct integers, nums, return all possible subsets (the power set).
 #
 # Note: The solution set must not contain duplicate subsets.
 #
diff --git a/README.md b/README.md
@@ -1,5 +1,5 @@
 # :pencil2: Leetcode Solutions with Python,Javascript
-Update time:  2017-10-22 12:28:25
+Update time:  2017-10-23 12:28:34
 
 Auto created by [leetcode_generate](https://github.com/bonfy/leetcode)
 

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`
`4`	`4`	`#`
`5`		`-# Given a set of distinct integers, nums, return all possible subsets.`
	`5`	`+# Given a set of distinct integers, nums, return all possible subsets (the power set).`
`6`	`6`	`#`
`7`	`7`	`# Note: The solution set must not contain duplicate subsets.`
`8`	`8`	`#`