LeetCode[Hash Table]: Two Sum

最新推荐文章于 2019-03-08 12:31:29 发布

原创最新推荐文章于 2019-03-08 12:31:29 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #hash table #map #c++ #算法

LeetCode 同时被 2 个专栏收录

74 篇文章

订阅专栏

LeetCode

72 篇文章

订阅专栏

本文介绍了一种高效的方法来解决寻找数组中和为目标数的两个元素的问题，通过使用哈希表优化了查找过程，避免了传统的双重循环导致的时间复杂度升高。

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

Brute force

vector<int> twoSum(vector<int> &numbers, int target) {
    vector<int> answer;
    for (int i = 0; i < numbers.size() - 1; i++)
        for (int j = i + 1; j < numbers.size(); j++)
            if (numbers[i] + numbers[j] == target) {
                answer.push_back(i + 1);
                answer.push_back(j + 1);
                return answer;
            }

    return answer;
}

Result: Time Limit Exceeded

Hash table

vector<int> twoSum(vector<int> &numbers, int target) {
    vector<int> answer;
    map<int, int> numMap;
    for (int i = 0; i < numbers.size(); i++)
        if (numMap.find(target - numbers[i]) != numMap.end()) {
            answer.push_back(numMap[target - numbers[i]] + 1);
            answer.push_back(i + 1);
            return answer;
        }
        else numMap[numbers[i]] = i;

    return answer;
}