001Two Sum (C)

原创于 2016-01-03 21:29:39 发布 · 387 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一个经典的编程问题——两数之和问题，并提供了一种有效的解决方案。该问题要求从整数数组中找出两个数，使得它们的和等于特定的目标值。文章给出的函数twoSum能够返回这两个数的下标，且确保第一个下标小于第二个下标。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target) {
    int i,j;
    int *a=(int*)malloc(sizeof(int)*2);
    for(i=0;i<numsSize;i++){
        for(j=i+1;j<numsSize;j++){
            if(nums[i]+nums[j]==target){
                a[0]=i+1;
                a[1]=j+1;
                return a;
            }
        }
    }
}