Two Sum[LeetCode 1]

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/cyrususie/article/details/78706461

Ans

---

#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> ans;
        unordered_map<int, int> computeAns;
        for (int i = 0; i < nums.size(); i++) {
            int complement = target - nums[i];
            if (computeAns.find(complement) != computeAns.end()) {
                ans.push_back(computeAns[complement]);
                ans.push_back(i);
                return ans;
            }
            computeAns[nums[i]] = i;
        }
        return ans;
    }
};