聲明:本文題目來自leetcode
/*
示例 1:
輸入:nums = [2,7,11,15], target = 9
輸出:[0,1]
解釋:因為 nums[0] + nums[1] == 9 ,傳回 [0, 1] 。
示例 2:
輸入:nums = [3,2,4], target = 6
輸出:[1,2]
示例 3:
輸入:nums = [3,3], target = 6
輸出:[0,1]
提示:
2 <= nums.length <= 103
-109 <= nums[i] <= 109
-109 <= target <= 109
隻會存在一個有效答案
*/
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
//将不比對的值往,某一個map裡面村,直到周遊完一邊之後,總會比對到內插補點
map<int, int> a;
for(int i=0; i<numSize; i++)
{
int tnum = target-nums[i];
if(a.count(tnum)>0){
returnSize[0] = tnum;
returnSize[1] = i
break;
}
a[nums[i]] = 1;
}
return returnSize;
}