1.Two Sum

红太狼 2022-06-10 14:09 274阅读 0赞

/*
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
*/
//解法一 103ms
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target) {
int* num;
num = (int*)malloc(2*sizeof(int*));
int i,j;
for(i=0;i<numsSize-1;i++)
for(j=i+1;j<numsSize;j++)
if( ( (nums[i] + nums[j]) == target) && ( i != j ) )
{
num[0] = i;
num[1] = j;
return num;
}
return;
}

发表评论

表情：
评论列表 （有 0 条评论，274人围观）

还没有评论，来说两句吧...

相关阅读