leetcode-0001-Two-Sum

实现思路：首先生成一个哈希表用于记录数组的值对应的索引，遍历数组，将每一个值放入哈希表当中，同时查找target-num[i]是否在哈希表当中，如果存在，则返回两个值的索引，如果不存在，则输出无解

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

using namespace std;

/// One-Pass Hash Table
/// Time Complexity: O(n)
/// Space Complexity: O(n)
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {

        unordered_map<int,int> record;
        for(int i = 0 ; i < nums.size() ; i ++){

            int complement = target - nums[i];
            if(record.find(complement) != record.end()){
                int res[] = {i, record[complement]};
                return vector<int>(res, res + 2);
            }

            record[nums[i]] = i;
        }

        throw invalid_argument("the input has no solution");
    }
};


void printVec(const vector<int>& vec){
    for(int e: vec)
        cout << e << " ";
    cout << endl;
}

int main() {

    const int nums[] = {0,4,3,0};
    vector<int> nums_vec( nums, nums + sizeof(nums)/sizeof(int) );
    int target = 0;
    printVec(Solution().twoSum(nums_vec, target));

    return 0;
}