- 博客(2)
- 收藏
- 关注
原创 LeetCode: Combination Sum
#include#include#includeusing namespace::std;class Solution {public: vector > combinationSum(vector & candidates, int target) { map > > result; for(int i = 0; i <= target; i++) {
2012-09-30 11:35:34 521
原创 LeetCode: Climbing Stairs
#include#include#includeusing namespace::std;class Solution {public: //iteration int climbStairs(int n) { if(n == 0 || n == 1) return 1; int steps_n_2 = 1;
2012-09-26 12:34:23 309
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人