LeetCode 0001 - Two Sum

Reck Zhang

发布于 2021-08-11 10:16:18

1530

发布于 2021-08-11 10:16:18

文章被收录于专栏：Reck Zhang

Two Sum

Desicription

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

Solution

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-07，如有侵权请联系 cloudcommunity@tencent.com 删除

element