leetcode个人题解——#15 3sums

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int>> ans;
        for (unsigned int i = ; i < nums.size(); i++)
        {
            if(nums[i] > )return ans;
            if ((i>) && (nums[i]==nums[i-]))
            continue;
            int l = i+;
            int r = nums.size() - ;
            while(l < r)
            {
                int sum = nums[i] + nums[l] + nums[r];
                if (sum > ) r--;
                else if (sum < ) l++;
                else if (sum == )
                {
                    ans.push_back(vector<int>{nums[i],nums[l],nums[r]});
                    while(l<r && nums[l] == nums[l+])l++;
                    while(l<r && nums[r] == nums[r-])r--;
                    l++;
                    r--;
                }
            }
        }
        return ans;
    }
};

正好在学vector，简单练习一把。