leetCode-day1

#1.两数之和

给定一个整数数组和一个目标值，找出数组中和为目标值的两个数。
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, and you may not use the same element twice.

示例:

给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target) {
  // 结果为动态数组
    int *pArray = malloc(sizeof(int) * 2);
    int j = 0;
    int i = 0;
    for (i = 0; i < numsSize; i++)
    {
        for (j = i + 1; j < numsSize; j++)
        {
            if((nums[i] + nums[j]) == target)
            {
                pArray[0] = i;
                pArray[1] = j;
                break;
            }
        }
    }

    return pArray;
}

tips：if语句不加大括号的话，只是判断离if最近的语句是否执行。