- 博客(4)
- 收藏
- 关注
RSS订阅原创 Leetcode 416. Partition Equal Subset Sum
/** * given an array of positive integers and a target * find out if there exists a subset(s) that sum up to the target * subproblems: * 1. the subset includes nums[n] then return isSubsetSum(n-1,
2016-11-21 06:36:40
302
原创 Leetcode 375. Guess Number Higher or Lower II
@stupidbird911 said in [How does one think up DP solutions for these types of problems?](/post/122697):> Practice on similar questions, think carefully and you would get better understanding. Almost
2016-11-16 12:04:54
255
原创 Leetcode 120. Triangle
/** 1 * 1 2 * 1 2 3 * 1 2 3 4 * from bottom to top, we don't need to consider the last row (b/c if row # equals to 1 there's only one number just return this value), *
2016-11-03 11:52:15
213
原创 Leetcode 338. Counting Bits
/** * num binary cnt * 0 0 0 * 1 1 1 * --------------------------------- * 2 10 1+0 * 3 11 1+1 * --------------------
2016-11-02 11:45:03
170
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人