Leetcode热门100之两数之和

最新推荐文章于 2024-10-04 20:45:38 发布

Channel_R

最新推荐文章于 2024-10-04 20:45:38 发布

阅读量106

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Channel_R/article/details/107231372

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Leetcode热门100之两数之和

问题描述：

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.

示例：

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> mp;
        vector<int> result;
        for(int i = 0; i < nums.size(); i++){
            int remain = target - nums[i];
            if(mp.find(remain) != mp.end()){
                result.push_back(mp[remain]);
                result.push_back(i);
                return result;
            }
            mp[nums[i]] = i;
        }
        return result;
    }
};