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

暴力解法：

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> b;
        int len=nums.size();
        for(int i=0;i<len;i++)//从左到右遍历数组
        {
            for(int j=i+1;j<len;j++)//第一层循环遍历的下标之后进行第二次遍历
                if(nums[i]+nums[j]==target)
                {
                    b.push_back(i);
                    b.push_back(j);//内存消耗
                    return b;
                }
        }
        return b;
    }
};

哈希表(空间换时间)：

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> b;
        int len=nums.size();
        map<int,int> a;
        for(int i=0;i<len;i++)
        {
            if(a.count(target-nums[i]))
            {
                b.push_back(i);
                b.push_back(a.find(target-nums[i])->second);//哈希表查找时间复杂度O(1)
                return b;
            }
            a.insert(make_pair(nums[i],i));
        }
        return b;
    }
};