Leetcode 1.Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

`cpp class Solution { public: vector twoSum(vector& nums, int target) { vector ret; unordered_map sumMap; for(int i = 0; i < nums.size(); ++i){ if(sumMap.find(target-nums[i])!=sumMap.end()) { ret.push_back(i); ret.push_back(sumMap[target-nums[i]]); } else { sumMap[nums[i]] = i; } } return ret;
} }; ```

results matching ""

    No results matching ""