Two Sum

题目大意：给定一个数组，和一个数target，在这个数组里面找两个数，这两个数的和等于target

解题思路:hashTable

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<int> result;
        unordered_map<int, int> dict;

        for(int i = 0; i < numbers.size(); i++) {
            if(dict.find(target - numbers[i]) != dict.end()) {
                result.push_back(dict[target - numbers[i]] + 1);
                result.push_back(i + 1);
                break;
            }
            dict[numbers[i]] = i;
        }
        return result;
    }
};