【Leet Code】1. Two Sum

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

int* twoSum(int* nums, int numsSize, int target, int* returnSize){
    int*p=(int*)malloc(sizeof(int)*2);
    for(int i=0;i<numsSize-1;i++){
        for(int l=i+1;i<numsSize;l++){
            if(nums[i]+nums[l]==target){
                p[0]=i;
                p[1]=l;
                *returnSize=2;
                return p;
            }
        }
    }
    return p;
}