/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
int i,j,*p;
for(i=0;i<numsSize-1;i++) //使用暴力算法
{
for(j=i+1;j<numsSize;j++)
{
if(nums[i]+nums[j] == target)
{
*returnSize = 2;
p=(int *)malloc(2*sizeof(int));
p[0]=i;
p[1]=j;
return p;
}
}
}
*returnSize=0;
return NULL;
}
力扣:1.两数之和
于 2022-05-22 19:08:25 首次发布