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.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

注意：此题一定要malloc返回数组！

/*************************************************************************
    > File Name: LeetCode001.c
    > Author: Juntaran 
    > Mail: Jacinthmail@gmail.com
    > Created Time: 2016年04月25日 星期日 00时37分25秒
 ************************************************************************/
 
/*************************************************************************

    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.

    Example:
    Given nums = [2, 7, 11, 15], target = 9,

    Because nums[0] + nums[1] = 2 + 7 = 9,
    return [0, 1].

 ************************************************************************/


#include <stdio.h>
#include <malloc.h> 

int* twoSum(int* nums, int numsSize, int target) {
    
    int i = 0;
    int j = 0;
 //   int result[2];
    int *result = (int*)malloc(sizeof(int));
    
    
    for( i=0; i<numsSize; i++){
        for( j=i+1; j<numsSize; j++ ){
            if( ( target - nums[i] ) == nums[j] ){
                result[0] = i;
                result[1] = j;
                printf("[%d,%d]
",result[0],result[1]);
                return result;
            }
        }
    }
    printf("Not Fount!
");
    return 0;
}

int main(){
    
    int nums[] = {0,4,3,0};
    int numsSize = 4;
    int target = 0;
    
    twoSum( nums, numsSize, target);
    
    return 0;
}