1.题目:
2.分析:
由题意:我们要找到两个下标使nums[i]+nums[j]==target;而且答案具有唯一性最简单的方法就是遍历数组(两层for循环找到两个下标i,j);
3.实现:
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
for(int i=0;i<numsSize;i++){
for(int j=i+1;j<numsSize;j++){
if(nums[i]+nums[j]==target){
*returnSize = 2;
int* ans = (int*)malloc(sizeof(int) * 2);
ans[0] = i; ans[1] = j;
return ans;
}
}
}
*returnSize=0;
return NULL;
}