Two Sum leetcode

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

算法1：

将数组的数组映射到哈希表，key是元素的值，value是该值在数组中的索引。考虑到数组中元素有重复，我们使用STL中的unordered_multimap, 它可以允许重复的key存在。映射以后，对于数组中的某个元素num，我们只要在哈希表中查找num2 = target-num。需要注意的是在哈希表中找到了num2，并不一定代表找到了题目要求的两个数，比如对于数组2 7 11 15，target = 4，当num = 2时，num2 = target-num = 2，此时num2可以在哈希表中找到，但是num和num2指向的是同一个元素。因此当num2 = num时，在哈希表找到num2的同时，还需要保证哈希表中num2的个数>=2。

该算法时间复杂度为O（n）

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<int> res;
        if(numbers.size() == 0)
        return res;
        unordered_multimap<int,int> m;
        for(int i=0;i<numbers.size();i++) {
            m.insert(pair<int,int>(numbers[i],i+1));//m.insert(make_pair(numbers[i],i+1));// 往map插入元素的方法
        }
        for(int i=0;i<numbers.size();i++) {
            unordered_multimap<int,int>::iterator it;
            pair<unordered_multimap<int,int>::iterator,unordered_multimap<int,int>::iterator> range;
            //int indexLeft = m.find(numbers[i])->second;
            range = m.equal_range(target-numbers[i]);// 有可能有重复的关键字
            if(range.first != m.end()) {
                if((target-numbers[i]) == numbers[i]) {
                    if(m.count(numbers[i])>1) {
                        int indexLeft = range.first->second;
                        int indexRight = (++range.first)->second;// ++必须在前面才能先执行！！
                        int left = indexLeft<indexRight?indexLeft:indexRight;
                        int right = indexLeft>indexRight?indexLeft:indexRight;
                        res.push_back(left);
                        res.push_back(right);
                        break;
                    }
                } else {
                    int indexLeft = m.find(numbers[i])->second;
                    int indexRight = range.first->second;
                    int left = indexLeft<indexRight?indexLeft:indexRight;
                    int right = indexLeft>indexRight?indexLeft:indexRight;
                    res.push_back(left);
                    res.push_back(right);
                    break;
                }
            }
        }
        return res;
    }
};