1. Two Sum

最新推荐文章于 2019-06-02 15:51:25 发布

cyndi2011

最新推荐文章于 2019-06-02 15:51:25 发布

阅读量283

点赞数

分类专栏： LeetCode编程题

本文链接：https://blog.csdn.net/jiangyanting2011/article/details/53375984

版权

LeetCode编程题专栏收录该内容

30 篇文章 0 订阅

订阅专栏

1. Two Sum
Difficulty: Easy

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.
Example: Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
给定一个整数数组，返回数组中两个元素值相加和为target的索引。假定总存在唯一的结果。如 nums=[2,7,11,15], target=9 返回[0,1]

方法一：两重循环
时间复杂度O(n2)
空间复杂度O(1)

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