1.Two Sum

Two Sum
Category Difficulty Likes Dislikes
algorithms Easy (43.81%) 10587 350
Tags
Companies
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].

解答，自己首先想到的是暴力破解，双循环直接进行查找，代码如下，这种解法采用了双循环，导致耗时时间比较长
执行用时：252 ms：
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        for(int i=0;i<nums.size()-1;++i){
            for(int j=i+1;j<nums.size();++j){
                if(target ==(nums[i]+nums[j])){
                    result.push_back(i);
                    result.push_back(j);
                    break;
                }
            }
        }
        return result;
    }
};

查看到别人使用的
执行用时为 16 ms 的范例，利用map将数据及其下班进行对应，咋就是利用了map的count计数
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int,int> a;
        vector<int> b(2,-1);//C++11
        for(int i=0;i < nums.size();i++){
            if(a.count(target-nums[i])>0){
                b[0] = a[target-nums[i]];
                b[1] = i;
            }
            a[nums[i]] = i;
        }
        return b;
    };
};

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result(2,-1);
        map<int,int> temp;
        for(int i=0;i<nums.size();++i){
            if(temp.count(target-nums[i])>0){
                result[0]=temp[target-nums[i]];
                result[1]=i;
            }
            temp[nums[i]]=i;
        }
        return result;        
    }
};