脚本宝典收集整理的这篇文章主要介绍了1. Two Sum，脚本宝典觉得挺不错的，现在分享给大家，也给大家做个参考。

Question:

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9 Output: [0,1] Output: Because nums[0] + nums[1] == 9, we return [0, 1]. Example 2:

Input: nums = [3,2,4], target = 6 Output: [1,2] Example 3:

Input: nums = [3,3], target = 6 Output: [0,1]

Constraints:

2 <= nums.length <= 104 -109 <= nums[i] <= 109 -109 <= target <= 109 Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

Solution 1:

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((nums[j] + nums[i]) == target)
                {
                    result.push_back(i);
                    result.push_back(j);
                }
            }
        }
        return result;
    }
};

优化后方案 Solution 2（速度比方案1快100倍）:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;  
        unordered_map<int ,int> hashMap;
        for(int i = 0; i < nums.size(); i++)
        {
            int num = target-nums[i];
            if(hashMap.find(num) != hashMap.end()){
                result.push_back(hashMap[num]);
                result.push_back(i);
                return result;
            }
            hashMap[nums[i]] = i;
        }
        return result;

    }
};

脚本宝典总结

以上是脚本宝典为你收集整理的1. Two Sum全部内容，希望文章能够帮你解决1. Two Sum所遇到的问题。

如果觉得脚本宝典网站内容还不错，欢迎将脚本宝典推荐好友。

本图文内容来源于网友网络收集整理提供，作为学习参考使用，版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ：384754419，请注明来意。