牛客每日一题

三数之和

题目描述

给出一个有n个元素的数组S，S中是否有元素a,b,c满足a+b+c=0？找出数组S中所有满足条件的三元组。

class Solution {
public:
    vector<vector<int> > threeSum(vector<int> &num) {
        
    }
};

中心扩展法

#include<algorithm>
class Solution {
  public:
    vector<vector<int> > threeSum(vector<int>& num) {
        vector<vector<int> > x;
        vector<int > time;
        int count;
        int s[count];
        count = num.size();
        if (count < 3) {
            return x;
        }
        for (int i = 0; i < count; i++) {
            s[i] = num[i];
        }
        sort(s, s + count);
        int r, l, numx;
        for (int i = 0; i < count - 2; i++) {
        // 这是示例[0,0,0,0]解决办法，看了大佬的解题思路
            if (s[i] == s[i - 1] && i)continue;
            r = i + 1;
            l = count - 1;
            while (r < l) {
                if ((s[i] + s[r] + s[l]) == 0) { 
                    time.push_back(s[i]);
                    time.push_back(s[r]);
                    time.push_back(s[l]);
                    x.push_back(time);
                    time.clear();
                    while (s[l] == s[l - 1] && l - 1 > r)l--;
                    while (s[r] == s[r + 1] && r + 1 < l)r++;
                    r++;
                    l--;
                } else if ((s[i] + s[r] + s[l]) > 0) {
                    l--;
                } else if ((s[i] + s[r] + s[l]) < 0) {
                    r++;
                }
            }
        }
        return x;
    }
};