leetcode 1. Two Sum （C语言）12

贴原题：

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].

解析：

　　本题就是给出一组数，和一个目标值，让我们找出数组中的两个数，使得两数之和等于目标值，并返回两个数在那个数组中的下标。

　　那么我们用一个嵌套循环，扫描到满足条件的两个数并返回其下标即可。

贴代码：

/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target) {
int* reNums=(int *)malloc(2*sizeof(int));
for(int i=0; i<numsSize; i++)
{
int flag=0;
for(int j=i+1; j<numsSize; j++)
{
if(*(nums+i)+*(nums+j)==target)
{
*reNums=i;
*(reNums+1)=j;
flag=1;
break;
}
if(flag)
{
break;
}
}
}
return reNums;
}