2016-01-21 17:13

求大神帮忙 C语言 LeetCode的 Two Sum问题

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

Subscribe to see which companies asked this question

/**

• Note: The returned array must be malloced, assume caller calls free(). / int twoSum(int* nums, int numsSize, int target) { int i,j; int index1,index2; for(i=0;i<numsSize;i++) { for(j=0;j<numsSize;j++) { if(nums[i]!=0 && nums[j]!=0) { if(nums[i]+nums[j]==target) { if(nums[i]<=nums[j]) { index1=i+1; index2=j+1; } else { index1=j+1; index2=i+1; } } } } } printf("[%d,%d]",index1,index2); }
• 写回答
• 好问题 提建议
• 追加酬金
• 关注问题
• 收藏
• 邀请回答

2条回答默认 最新

• threenewbee 2016-01-21 18:57
已采纳
`````` int* twoSum(int* nums, int numsSize, int target) {
int i,j;
int index1,index2;
for(i=0;i<numsSize;i++)
{
for(j=0;j<numsSize;j++)
{
if(nums[i]!=0 && nums[j]!=0)
{
if(nums[i]+nums[j]==target)
{
if(nums[i]<=nums[j])
{
index1=i+1;
index2=j+1;
}
else
{
index1=j+1;
index2=i+1;
}
}
}
}
}
printf("[%d,%d]",index1,index2);
int * arr = (int *)malloc(sizeof(int) * 2);
arr[0] = index1;
arr[1] = index2;
return arr;
}

int main()
{
int nums[] = {2,7,11,15};
int *p  = twoSum(nums, 4, 9);
free(p);
}
``````

如果你的程序没有别的错，它和它的调用者应该是这样的

评论
解决 无用
打赏 举报
• 查看更多回答(1条)