LeetCode:001.两数之和

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 j=i+1;j<numsSize;j++)
        {
            if(nums[i]+nums[j]==target)
            {
                p[0]=i;
                p[1]=j;
                *returnSize=2;
                return p;
            }
        }
    }
    return p;
}