leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0001.cpp (365B)

0 class Solution { 1 public: 2 vector<int> twoSum(vector<int> &nums, int target) { 3 unordered_map<int, int> um; 4 for (int i = 0; i < nums.size(); i++) 5 if (um.find(target - nums[i]) != um.end()) 6 return {um[target - nums[i]], i}; 7 else 8 um.insert(make_pair(nums[i], i)); 9 return {}; 10 } 11 };