1. 两数之和Two Sum

给定一个整数数组和一个目标值，找出数组中和为目标值的两个数。

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.

示例:

给定 nums = [2, 7, 11, 15], target = 9

因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

• c语言my

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target) {
    int sum;
    for(int i=0;i<numsSize-1;i++)
        for(int j=i+1;j<numsSize;j++)
        {

                sum=nums[i]+nums[j];
                if(sum==target)
                {
                    int *a;
                    a= (int *)malloc(sizeof(int)*2);
                    a[0]=i;
                    a[1]=j;
                     return a;
                }

        }
    return false;
}

返回数组的方法

int *a;
a= (int *)malloc(sizeof(int)*2);
a[0]=i;
a[1]=j;
 return a;