1. Two Sum

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

郭大侠写leetcode

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

阅读量344

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u013547284/article/details/56307616

版权

leetcode 专栏收录该内容

46 篇文章 1 订阅

订阅专栏

题目链接：https://leetcode.com/problems/two-sum/?tab=Description

Description

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

My Answer

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