leetcode no1 - beyondnlp/nlp GitHub Wiki

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target) {

    int *result;
    int i, j, ntarget ;
    int *presult;

    presult = result = malloc(sizeof(int)*(numsSize/2));

    for( i = numsSize-1; i > 0; i-- ){
        ntarget = target - nums[i];
        for( j = i-1; j >= 0; j-- ){
            if( !(ntarget - nums[j] ) ){
                    *presult++=i;
                    *presult++=j;
                    return result; 
            }    
        }
    }
    return result;  

}