12_leetcode_3Sum

最新推荐文章于 2024-09-27 15:30:00 发布

ezzffzz

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量283

点赞数

分类专栏： leetcode 编程算法文章标签： leetcode 算法编程语言面试

本文链接：https://blog.csdn.net/ezzffzz/article/details/28586901

版权

leetcode 同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

编程

155 篇文章 0 订阅

订阅专栏

算法

155 篇文章 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:

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)

1.数组的个数小于3；2.对数组进行升序排序；3.从前往后遍历数组，确定第一个元素，之后在后面的元素中确定另外两个元素，注意相同元素的情况。

    vector<vector<int> > threeSum(vector<int> &num)
    {
        vector<vector<int> > result;
        
        if(num.size() <= 2)
            return result;
        
        sort(num.begin(), num.end());
        vector<int> triplet;
        
        int size = (int)num.size();
        
        for(int i = 0; i < size-2 && num[i] <= 0; i++)
        {
            if(i == 0 || num[i] != num[i-1])
            {
                int leftValue = 0 - num[i];
                triplet.push_back(num[i]);
                
                int left = i + 1;
                int right = size - 1;
                while(left < right)
                {
                    if(num[left] + num[right] == leftValue)
                    {
                        triplet.push_back(num[left]);
                        triplet.push_back(num[right]);
                        
                        result.push_back(triplet);
                        triplet.pop_back();
                        triplet.pop_back();
                        
                        right--;
                        while(left < right && num[right] == num[right+1])
                            right--;
                    }
                    else if(num[left] + num[right] > leftValue)
                    {
                        right--;
                    }
                    else
                    {
                        left++;
                    }
                }
                triplet.pop_back();
            }
        }
        return result;
    }