leetcode第1题 两数之和 C语言实现

https://leetcode.cn/problems/two-sum/

暴力破解：双层循环遍历数组，注意k≠i，所以第二重循环每次从i+1开始。

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
    int *result = (int *)malloc(sizeof(int)*2);
    for(int i=0; i<numsSize; i++){
        for(int k=i+1; k<numsSize; k++){
            if(nums[i]+nums[k]==target){
                result[0] = i;
                result[1] = k;
                *returnSize = 2;
                return result;
            }
        }
    }
    *returnSize = 0;
    return NULL;
}