Sunday, October 8, 2017

[LeetCode]Combination Sum

Backtrack的题,没啥太多好讲。时间复杂度O(k),k为结果集的数量。空间复杂度O(len),len为给定array长度,代码如下:


No comments:

Post a Comment