leetcode twoSum

最新推荐文章于 2024-05-19 10:23:12 发布

原创最新推荐文章于 2024-05-19 10:23:12 发布 · 436 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

Algorithm 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的高效算法。给定一个整数数组及目标值，找出数组中和为目标值的两个数的索引。算法通过使用映射表存储已遍历过的元素及其索引，快速查找目标补数是否存在。

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

and the solution as follow:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int,int> targetx;
        vector<int> result;
        for(int i = 0;i<nums.size();++i){
            targetx[nums[i]]=i;
        }
        for(int j = 0;j<nums.size();++j){
            int minus = target - nums[j];
            if(targetx.count(minus) && targetx[minus]!=j){
                result.push_back(min(j,targetx[minus]));
                result.push_back(max(j,targetx[minus]));
                return result;
            }
        }
    }
};