5 lines C++


  • 0
    class Solution {
    public:
        vector<int> twoSum(vector<int>& nums, int target) {
            unordered_map<int, int>m;
            for(int i = 0; i < nums.size(); i++){
                if(m.count(target - nums[i])) return {m[target - nums[i]], i};
                m[nums[i]] = i;
            }
        }
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.