【数组】两数之和TwoSum

暴力算法：

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