167. Two Sum II

题目

Given an array of integers that is already sorted in ascending order, 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<int> twoSum(vector<int>& numbers, int target) {
    auto len = numbers.size();
    vector<int>::size_type i, j;
    vector<int> res;

    for (i = 0; i < len; i++) {
        int temp = target - numbers[i];
        for (j = i + 1; j < len; j++) {
            if (numbers[j] == temp)
                break;
        }
        if (j != len) {
            res.push_back(i+1);
            res.push_back(j+1);
            break;
        }


    }
    return res;
}

方法二：利用map
map可以存储键值对，我们可以同时将

vector<int> twoSum(vector<int>& numbers, int target) {
    map<int, int> m;
    vector<int>::size_type i ;
    vector<int> res;
    for (i = 0; i < numbers.size(); i++) {
        auto flag = m.insert(make_pair(numbers[i], i));
        m.insert(make_pair(target - numbers[i], i));
        if (!flag.second) {
            //下面这句话很关键，可以排除是重复元素导致的不能插入。
            if (target - flag.first->first == numbers[flag.first->second]) {
                res.push_back(flag.first->second + 1);
                res.push_back(i + 1);
                break;
            }
        }
    }
    return res;
}

ps: 这两种方法都不是很好，时间复杂度很高.楼主还在继续思考。