摘要:
class Solution {public: int threeSumClosest(vector &num, int target) { int len = num.size(); sort(num.begin(),num.end()); i... 阅读全文
摘要:
class Solution {public: vector > threeSum(vector &num) { vector>result; vectorvec; int len = num.size(); //assert(l... 阅读全文
摘要:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文