Two Sum

Posted 凯鲁嘎吉

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Two Sum相关的知识,希望对你有一定的参考价值。

凯鲁嘎吉 - 博客园

http://www.cnblogs.com/kailugaji/

Question:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,

return [0, 1].

Answer:

int* twoSum(int* nums, int numsSize, int target) {
int j, i;
int *test = NULL;
test = (int )malloc(2*sizeof(int));
 for (i=0; i<numsSize ;i++){
  for (j=i+1; j<numsSize ;j++){
   if(nums[i]+nums[j] == target){
    *(test) = i;
    *(test+1) = j;
    }
  }
 }
 return test;
}
Run Code Result:
Your input
[3,2,4]
6
Your answer
[1,2]
Expected answer
[1,2]
Show Diff
Runtime: 4 ms

 

以上是关于Two Sum的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode #001# Two Sum详解(js描述)

Leetcode - 371. Sum of Two Integers

1 代码片段1

每日一算法之two sum

LeetCode(371) Sum of Two Integers

1_Two Sum --LeetCode