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, and you may not use the same element twice.

Example:

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

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

python解法一：

def twoSum(self, nums, target):
    for i in range(len(nums)) :
        for j in range(1,len(nums)-i) :
            if nums[i] + nums[i+j]==target :
                return i,j+i

C语言解法一：

int* twoSum(int* nums, int numsSize, int target) {
    int i,j;
    static int res[2];
    for (i=0; i<numsSize; i++) {
        for (j=i+1; j<numsSize; j++) {
            if (nums[i]+nums[j]==target) {
                res[0]=i;
                res[1]=j;
                break;
            } else {
                continue;
            }
        }
    }
    return res;
}