Leetcode-1. Two Sum

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

C语言代码

int* twoSum(int* nums, int numsSize, int target) {  
    int *a = (int*)malloc(2*sizeof(int));  
    for(int i = 0;i<numsSize;i++)  
    {  
        for(int j = i+1;j<numsSize ;j++)  
        {  
            if(nums[i] + nums[j] == target)  
            {  
                a[0] = i;  
                a[1] = j;  
            }  
        }  
    }  
    return a;  
}