emmmm由于还在学数据结构与算法,不会哈希表所以就用暴力法解题了
代码
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target)
{
int i,j;
int sum;
int *ArryNode;
for(i = 0; i < (numsSize - 1) ; i++)
for(j = (i+1); j < numsSize; j++)
{
sum = nums[i] + nums[j];
if(sum == target)
{
ArryNode = (int *)malloc(2*sizeof(int));
ArryNode[0] = i;
ArryNode[1] = j;
return ArryNode;
}
}
return NULL;
}