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].
1 //时间O(N^2) 你的平方 空间 O(1) 2 int* twoSum_1(int* nums, int numsSize, int target) { 3 int i=0; 4 int j=0; 5 int *rtn=NULL; 6 for(i=0;i<numsSize-1;i++) 7 { 8 for(j=i+1;j<numsSize;j++) 9 { 10 if(target-nums[j]==nums[i]) 11 { 12 rtn=malloc(2*sizeof(int)); 13 rtn[0]=i; 14 rtn[1]=j; 15 return rtn; 16 17 } 18 } 19 } 20 return rtn; 21 }
原文：http://www.cnblogs.com/zhongpeter/p/7499644.html
