Commit 4b4e9e5

authored

Update Readme.md

1 parent 248b8a7 commit 4b4e9e5Copy full SHA for 4b4e9e5

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -39,4 +39,6 @@ for (int i=curPos; i<n; i++)`
`39`	`39`
`40`	`40`	`最终的答案就是考察state=(1<<n)-1时的dp值是否不为-1. (其实,如果dp值不为-1的话,它一定是0,因为我们预判了所有元素之和必然要被target整除)`
`41`	`41`
	`42`	+该解法的时间复杂度是```2^n*n```.
	`43`	`+`
`42`	`44`	`[Leetcode Link](https://leetcode.com/problems/partition-to-k-equal-sum-subsets)`

Comments

(0)