leetcode 15-三数之和

给你一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c ，使得 a + b + c = 0 ？请你找出所有和为 0 且不重复的三元组。

注意：答案中不可以包含重复的三元组。

示例 1：

输入：nums = [-1,0,1,2,-1,-4]
输出：[[-1,-1,2],[-1,0,1]]

示例 2：

输入：nums = []
输出：[]

示例 3：

输入：nums = [0]
输出：[]

提示：

0 <= nums.length <= 3000
-105 <= nums[i] <= 105

 

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
int cmp(const void *a,const void *b){
    return *(int*)a - *(int*)b;
}

int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
    * returnSize = 0;
    if(numsSize < 3)
        return NULL; 
    *returnColumnSizes = malloc(sizeof(int) * numsSize* numsSize);
    int** res = (int**)malloc(sizeof(int*) * numsSize* numsSize);

    qsort(nums,numsSize,sizeof(int),cmp);

    int i = 0, j = 0, k = 0, sum  = 0;
    for(i = 0; i < numsSize - 2; i++){
        if(nums[i] > 0)
            return res;
        //跳过相同的数据
        if(i > 0 && nums[i] == nums[i - 1])
            continue;

         j = i + 1;
         k = numsSize - 1;
        //双指针遍历
        while(j < k){
            sum = nums[i] + nums[j] + nums[k];
            if(sum == 0){
                res[*returnSize] = (int *)malloc(sizeof(int) * 3);
                res[*returnSize][0] = nums[i];
                res[*returnSize][1] = nums[j];
                res[*returnSize][2] = nums[k];
                (*returnColumnSizes)[*returnSize] = 3;
                (*returnSize)++;
                //过滤相同的值
                while((j < k) && (nums[j] == nums[++j]));
                while((j < k) && (nums[k] == nums[--k]));
            }else if(sum > 0)
                k--;        //右边递减
            else 
                j++;        //左边递增
        }   
    }

    return res;
}