摘要：
class Solution {public: int search(int A[], int n, int target) { if (n last) { left = mid; } else { ... 阅读全文
摘要：
class Solution {private: vector > result;public: vector > pathSum(TreeNode *root, int sum) { result.clear(); vector path; d... 阅读全文