3sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note: The solution set must not contain duplicate triplets.

For example, given array S = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

class Solution {
public:
   vector<vector<int>> threeSum(vector<int>& nums) {
    vector<vector<int>> triples;
    sort(nums.begin(), nums.end());
    int i = 0, last = nums.size() - 1;
    while (i < last) {
        int a = nums[i], j = i+1, k = last;
        while (j < k) {
            int b = nums[j], c = nums[k], sum = a+b+c;
            if (sum == 0) triples.push_back({a, b, c});
            if (sum <= 0) while (nums[j] == b && j < k) j++;
            if (sum >= 0) while (nums[k] == c && j < k) k--;
        }
        while (nums[i] == a && i < last) i++;
    }
    return triples;
}
};

最接近的三数之和

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        int res = nums[0] + nums[1] + nums[2];
        for(int i = 0; i < nums.size() - 2; i++){
            int j = i + 1, k = nums.size() - 1;
            while(j < k){
                int num = nums[i] + nums[j] + nums[k];
                if(abs(num - target) < abs(res - target)) res = num;
                if(num < target) j++;
                else k--;
            }
        }
        return res;
    }
};

class Solution {  
public:  
   int threeSumClosest(vector<int>& nums, int target) {
    long res = -100000000;
    sort(nums.begin(), nums.end());  
    int i = 0, last = nums.size() - 1;  
    while (i < last) {  
        int a = nums[i], j = i+1, k = last;  
        while (j < k) {  
            int b = nums[j], c = nums[k], num = a+b+c;  
            if(abs(num - target) < abs(res - target)) 
                res = num;  
            
            if (num <= target) while (nums[j] == b && j < k) j++;  
            if (num >= target) while (nums[k] == c && j < k) k--;  
        }  
        while (nums[i] == a && i < last) i++;  
    }  
    return res;  
}  
};