Leetcode - [Easy]1. Two Sum

leetcode.com/problems/two-sum/

Two Sum - LeetCode

 

solution

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