leetcode twosum

题目描述

给出一个整数数组，请在数组中找出两个加起来等于目标值的数，

你给出的函数twoSum 需要返回这两个数字的下标（index1，index2），需要满足 index1 小于index2.。注意：下标是从1开始的

假设给出的数组中只存在唯一解

例如：

给出的数组为 {2, 7, 11, 15},目标值为9
输出 ndex1=1, index2=2

 

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

 

可以用双循环查找，O（n2）

也可以遍历一遍，并放入map中，。

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