Leetcode 1. Two Sum

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 语言：

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