【leetcode】（每日抑题 1 两数之和）

又回到最初的起点 记忆中青涩的脸

//C语言
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
    if (nums == NULL || numsSize == 0) {
        *returnSize = 0;
        return NULL;
    }

    for (int i = 0; i < numsSize - 1; i++) {
        int newTarget = target - nums[i];
        for(int j = i + 1; j < numsSize; j++) {
            if(nums[j] == newTarget) {
                int *res = (int *)malloc(sizeof(int) * 2);
                res[0] = i;
                res[1] = j;
                *returnSize = 2;
                return res;
            }
        }
    }
    *returnSize = 0;
    return NULL;
}