Update find-array-given-subset-sums.py

kamyu104 · web-flow · commit 96d43c700858 · 2021-08-25T14:26:33.000+08:00
diff --git a/Python/find-array-given-subset-sums.py b/Python/find-array-given-subset-sums.py
@@ -16,7 +16,7 @@
 #      => [-d]+[(-x1), ..., (-xi)]+[x(i+1), ..., x(n-1)] is also a solution
 #
 # [conclusion]
-# - if new_sums with +d/-d both contain zero, we can choose either one
+# - if new_sums with +d/-d (including d = 0) both contain zero, we can choose either one
 # - if only one of new_sums with +d/-d contains zero, we can only choose the one with zero since subset_sums must contain zero
 
 # optimized from solution4 (not using dict), runtime: 1040 ms

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@`
`16`	`16`	`# => [-d]+[(-x1), ..., (-xi)]+[x(i+1), ..., x(n-1)] is also a solution`
`17`	`17`	`#`
`18`	`18`	`# [conclusion]`
`19`		`-# - if new_sums with +d/-d both contain zero, we can choose either one`
	`19`	`+# - if new_sums with +d/-d (including d = 0) both contain zero, we can choose either one`
`20`	`20`	`# - if only one of new_sums with +d/-d contains zero, we can only choose the one with zero since subset_sums must contain zero`
`21`	`21`
`22`	`22`	`# optimized from solution4 (not using dict), runtime: 1040 ms`