leetcode 15:三数之和

vector<vector<int>> threeSum(vector<int>& nums) { vector<vector<int>> a; vector<int> b; sort(nums.begin(),nums.end()); if(nums.size()<3) return a; int sum=-1; for(int i=0;i<nu

>>阅读原文<<