- 博客(19)
- 收藏
- 关注
原创 162. Find Peak Element
class Solution { public: int findPeakElement(const vectorint> &num) { return findPeakElement(num,0,num.size()-1); } private: int findPeakElement(const vectorint>
2017-06-28 17:24:56 200
原创 106. Construct Binary Tree from Inorder and Postorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };
2017-06-04 23:47:28 177
原创 105. Construct Binary Tree from Preorder and Inorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };
2017-06-04 23:46:15 164
原创 39. Combination Sum
class Solution {public:vector > combinationSum(vector& candidates, int target) {vector > res;vector path;sort(candidates.begin(),candidates.end());helper(candidates, 0, 0, target, path, re
2017-04-15 22:53:56 176
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人