Two Sum

最新推荐文章于 2024-04-07 20:30:43 发布

QxQ_Alter

最新推荐文章于 2024-04-07 20:30:43 发布

阅读量211

点赞数

分类专栏：算法题目笔记

本文链接：https://blog.csdn.net/QxQ_Alter/article/details/79115811

版权

算法题目笔记专栏收录该内容

17 篇文章 0 订阅

订阅专栏

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) {
        unordered_map<int, int> m;
        vector<int> res;
        for (int i = 0; i < nums.size(); ++i) {
            m[nums[i]] = i;
        }
        for (int i = 0; i < nums.size(); ++i) {
            int j = target - nums[i];
            if (m.count(j) && m[j] != i) {
                res.push_back(i);
                res.push_back(m[j]);
                break;
            }
        }
        return res;
    }
};