【Leetcode】Two Sum

题目：

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

解题思路：我一开始尝试用vector的泛型算法find来查找，但由于vector的find的算法复杂度为O(n)，导致整个算法复杂度为O(n^2)，结果超时。后来改用hash表来查找，通过Map实现的hash表使用find查找时复杂度为O(logn)，因此整个算法复杂度降到了O(nlogn)，顺利通过。需要留心某个数可以分解为两个相同的数的和的情况，你找到的两个值在数组里可能是同一个位置上的值，需要排除这种情况。

代码1（复杂度O(n^2)，超时）：

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

代码2（复杂度O(nlogn)，顺利通过）：

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