从零开始的LC刷题(1): Two Sum I C语言实现

原题：

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语言写了下很简单的哈希表算法，效果还不错

结果：
Success
Runtime: 4 ms, faster than 99.60% of C online submissions for Two Sum.
Memory Usage: 7.5 MB, less than 91.67% of C online submissions for Two Sum.

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target) {
    int hash[1000]={0};
    int *answer=(int*)malloc(2*sizeof(int)); 
    for (int i=0;i<=numsSize-1;i++){
        if (nums[i]>=0){hash[nums[i]%1000]=1;}
        else{hash[1000+nums[i]%1000]=1; }
    }
    int indicator=0;
    for (int i=0;i<=numsSize;i++){
        if(((target-nums[i])%1000>=0&&hash[(target-nums[i])%1000]==1)||((target-nums[i])%1000<0&&hash[(target-nums[i])%1000+1000]==1)){
            int j;
            for(j=i+1;j<=numsSize-1;j++){if(nums[j]==target-nums[i]&&i!=j){indicator=j;}}
            if(indicator!=0){
                *(answer+0)=i;
                *(answer+1)=indicator;
                indicator=0;
                return answer;
                            }
            }
       }
    return 0;
}