two-sum

最新推荐文章于 2024-11-16 00:49:04 发布

llwjason5555

最新推荐文章于 2024-11-16 00:49:04 发布

阅读量167

点赞数

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

本文链接：https://blog.csdn.net/llwjason5555/article/details/77871773

版权

leetcode 专栏收录该内容

116 篇文章 0 订阅

订阅专栏

题目：

Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

程序：

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        map<int, int> m;
        vector<int> ret;
        for (int i = 0; i < numbers.size(); i++)
            m[numbers[i]] = i;
        for (int i = 0; i < numbers.size(); i++)
        {
            if (m.find(target - numbers[i]) != m.end()&&m[target-numbers[i]]>i)
            {
                ret.push_back(i + 1);
                ret.push_back(m[target - numbers[i]] + 1);
                break;
            }
        }
        return ret;
    }
};