Leetcode c语言-Two Sum

Leedcode上面的题对面试很有帮助，problem上的solutions也有很多，但都是java，python，c++，js等高级语言的解答，用c的很少，Leecode也是在不久前才增加了对c的支持，接下来本人开始对problem进行c语言解答。

Title:

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].

该题目意思是给定一个数组和一个数字目标，求出数组中哪两个数字相加等于该数字目标，并返回这两个数字的位置。

这道题目属于easy，就不过多解释，直接给出solutions。

Solutions:

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