LeetCode 15. 3Sum

最新推荐文章于 2020-12-27 09:28:24 发布

Lonvon_

最新推荐文章于 2020-12-27 09:28:24 发布

阅读量225

点赞数

分类专栏： LeetCode 文章标签： leetcode 二分查找

本文链接：https://blog.csdn.net/Lonvon_/article/details/52653413

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

题目：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]]

分析：一个比较容易的二分题。首先排序，然后对每个 $S_i$ 和 $S_j$ 的组合，二分查找是否有 $S_k=-S_i-S_j$ 存在于S中。为了避免重复，在内层循环中j从i+1开始，k从j+1开始，这样既不会重复，也不会遗漏。

#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;

class Solution {
public:
    bool find(vector<int>& nums, int val, int a) {
        int i = a, j = nums.size() - 1, mid;
        while (i <= j) {
            mid = (i + j) / 2;
            if (nums[mid] == val) return true;
            else if (nums[mid] < val) i = mid + 1;
            else j = mid - 1;
        }
        return false;
    }
    vector<vector<int> > threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int> > res;
        int size = nums.size();
        if (size == 0) return res;
        for (int i = 0; i < size; i++) {
            for (int j = i + 1; j < size; j++) {
                int c = -(nums[i] + nums[j]);
                if (find(nums, c, j + 1)) {
                    vector<int> v;
                    v.push_back(nums[i]);
                    v.push_back(nums[j]);
                    v.push_back(c);
                    res.push_back(v);
                }
                while (j < size - 1 && nums[j + 1] == nums[j]) j++;
            }
            while (i < size - 1 && nums[i + 1] == nums[i]) i++;
        }
        return res;
    }
};