LeetCode --Two Sum

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.

Example:

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

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

解题思路

读上面题,就是输入一个数组和一个目标数,将要找出数组中两个元素之和为目标数的下标,然后将小标保存到只有两个元素的数组中,作为函数返回值.这里值得注意的是,我们在给数组分配内存的时候,最好用calloc函数,这样顺便就初始化了.

---

C语言版本

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

    return ret;
}

C++版本

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> ret;
        size_t len = nums.size();
        for (size_t i = 0; i < len; i++){
            for (size_t j = i; j < len; j++){
                if (nums[i] + nums[j] == target){
                    ret.push_back(i);
                    ret.push_back(j);
                    break;
                }
            }
        }
        return ret;
    }
};