【leetcode】1.双数之和

开启leetcode之路，自己最初的代码可能非常差，先作记录，，，

//extra code for test
#include<stdio.h>
#include<stdlib.h>
int main(int argc, char const *argv[])
{
    /* code */
    int* twoSum(int*,int,int);
    int nums[3] = {1,2,3};
    int numsSize = 3,target = 5;
    int* temp;
    temp = twoSum(nums,numsSize,target);
    printf("%d,%d",temp[0],temp[1]);
    return 0;
}


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