LeetCode Medium 3Sum

最新推荐文章于 2021-07-24 04:15:01 发布

原创最新推荐文章于 2021-07-24 04:15:01 发布 · 144 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #3Sum

LeetCode 同时被 2 个专栏收录

31 篇文章

订阅专栏

C/C++

21 篇文章

订阅专栏

探讨了在给定整数数组中寻找所有唯一三元组的问题，这些三元组的元素相加等于零，同时避免重复解决方案。通过排序和双指针技巧，实现了高效的算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array nums of n integers, are there elements a, b, c in nums 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.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

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

Solution

static int cmp(const void* a, const void* b) {
    return *(int*) a - *(int*) b;
}

int** threeSum(int* nums, int numsSize, int* returnSize) {
    if (numsSize < 3) return NULL;
    int** ans = calloc(20480, sizeof(int*));
    int i = 0, j, k, remain;
    (*returnSize) = 0;
    qsort(nums, numsSize, sizeof(int), cmp);
    
    for (i = 0; i < numsSize - 2; i++) {
        // remove duplicates
        if (i == 0 || i > 0 && nums[i] != nums[i - 1]) {
            j = i + 1;
            k = numsSize - 1;
            remain = 0 - nums[i];
            while (j < k) {
                if (nums[j] + nums[k] == remain) {
                    ans[*returnSize] = calloc(3, sizeof(int));
                    ans[*returnSize][0] = nums[i];
                    ans[*returnSize][1] = nums[j];
                    ans[*returnSize][2] = nums[k];
                    (*returnSize)++;
                    // remove duplicates
                    while (j < k && nums[j] == nums[j+1]) j++;
                    while (j < k && nums[k] == nums[k-1]) k--;
                    j++;
                    k--;
                } else if (nums[j] + nums[k] < remain) {
                    j++;
                } else {
                    k--;
                }
            }
        }
    }
    return ans;
}