LeetCode初级算法-数组-9
题目:两数之和
C语言解题:
int* twoSum(int* nums, int numsSize, int target) {
int *two = (int*)malloc(sizeof(int)*2);
int i, j;
for (i = 0; i < numsSize; i++)
{
for (j = i + 1; j < numsSize; j++)
{
if (nums[i] + nums[j] == target)
{
two[0] = i;
two[1] = j;
break;
}
}
}
return two;
}
遍历数组,如果和为target,就返回下标。