LeetCode---1. 两数之和

 1 /**
 2  * Note: The returned array must be malloced, assume caller calls free().
 3  */
 4 int* twoSum(int* nums, int numsSize, int target, int* returnSize){
 5     int i = 0, j = 0;
 6     int *p = (int *)malloc(sizeof(int) * 2);
 7 
 8     for(i = 0; i < numsSize; ++i)
 9     {
10         for(j = i + 1; j < numsSize; ++j)
11         {
12             if(target == nums[i] + nums[j])
13             {
14                 p[0] = i;
15                 p[1] = j;
16                 *returnSize = 2;
17                 return p;
18             }
19         }    
20     }
21     *returnSize = 0;
22     return p;
23 }