class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target)
    {
        map<int, int> nums_map;
        for (size_t i = 0; i < nums.size(); i++)
        {
            auto complement = target - nums[i];
            if (nums_map.find(complement) != nums_map.end()) return {(int)i, nums_map[complement]};

            nums_map[nums[i]] = i;
        }

        return {};
    }
};