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].
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target) {
if (numsSize == 0) {
return NULL;
}
int index0 = -1, index1 = -1;
for (int i=0; i < numsSize-1; i++) {
for (int j=i+1; j<numsSize; j++) {
if (nums[i] + nums[j] == target) {
index0 = i; index1 = j; break;break;
}
}
}
printf("%d\n", sizeof(int));
if (index0 != -1 && index1 != -1) {
int *p = (int *)malloc(2 * sizeof(int));
p[0] = index0;
p[1] = index1;
return p;
}
return NULL;
}
网友评论