LeetCode: 3Sum

最新推荐文章于 2024-11-06 11:05:01 发布

Tingmei

最新推荐文章于 2024-11-06 11:05:01 发布

阅读量1.1k

点赞数

分类专栏： C++ 算法文章标签： vector function class 算法 ie c

本文链接：https://blog.csdn.net/Tingmei/article/details/8034040

版权

算法同时被 2 个专栏收录

109 篇文章 0 订阅

订阅专栏

C++

108 篇文章 0 订阅

订阅专栏

Problem

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:

Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
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)

对数组先排序，然后确定三个数中的一个，最后利用两数之和算法遍历剩余数组。时间复杂度O(nlogn+n^2)。

class Solution {
public:
    vector<vector<int> > threeSum(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int nSize = num.size();
        vector< vector<int> > result;
        if (nSize < 3) return result;
        sort(num.begin(), num.end());
        int val = num[0] - 1;
        vector<int> mid(3);
        for (int i = 0; i < nSize - 2; ++i)
        {
            if (val == num[i]) continue;
            val = num[i];
            mid[0] = val;
            int sum = -val;
            int l = i + 1;
            int r = nSize - 1;
            int tmp = 0;
            while(l < r)
            {
                tmp = num[l] + num[r];
                if (tmp == sum)
                {
                    mid[1] = num[l];
                    mid[2] = num[r];
                    result.push_back(mid);
                    while(num[++l] == num[l-1] && l < r);
                    while(num[--r] == num[r+1] && r > l);
                }
                else if (tmp < sum)
                    ++l;
                else
                    --r;
            }
        }
        return result;
    }
};