摘要:
class Solution { public: vector> fourSum(vector& nums, int target) { if(nums.size() > res; sort(nums.begin(),nums.end()); for(int i=0;i cnt){n--;} els... 阅读全文
摘要:
//一次AC 有点爽的class Solution { public: int threeSumClosest(vector& nums, int target) { int res = 0; int minal = INT_MAX; sort(nums.begin(),nums.end()); for(int i=0;i ... 阅读全文
摘要:
//用类似双指针的方法,确定第一个i的位置后,j和k向左向右移动使nums[j]+nums[k] = -nums[i];注意特判class Solution { public: vector> threeSum(vector& nums) { if (nums.empty()||nums.size() > res; sort(nums.begin(),nu... 阅读全文