美文网首页
question1 Two Sum

question1 Two Sum

作者: 枫叶落尽 | 来源:发表于2018-07-08 22:10 被阅读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].

way1:
/**

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

相关文章

网友评论

      本文标题:question1 Two Sum

      本文链接:https://www.haomeiwen.com/subject/yadauftx.html