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].

java代码：

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] res;
        res = new int[2];
        for(int i = 0;i < nums.length; i++){
            for(int j = i+1; j<nums.length;j++){
                if(nums[i]+nums[j] == target){
                    res[0] = i;
                    res[1] = j;
                }
            }
        }
        return res;
    }
}

C语言代码：

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

原题地址