Leetcode - 1. Two Sum

Question:

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

Solution:

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */

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