leetcode 001 Two Sun

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

 //时间O(N^2) 你的平方    空间 O(1)
 int* twoSum_1(int* nums, int numsSize, int target) {
     int i=;
     int j=;
     int *rtn=NULL;
     for(i=;i<numsSize-;i++)
     {
         for(j=i+;j<numsSize;j++)
         {
             if(target-nums[j]==nums[i])
             {
                rtn=malloc(*sizeof(int));
                rtn[]=i;
                rtn[]=j;
                return rtn;

             }
         }
     }
     return rtn;
 }