class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int l = 0, r = nums.size() - 1;
unordered_map<int, int> hash;
vector<int> result;
for(int i = 0; i < nums.size(); i++) {
int t = target - nums[i];
if (hash.find(t) != hash.end()) {
result.push_back(hash[t]);
result.push_back(i);
return result;
}
hash[nums[i]] = i;
}
return result;
}
};