Leetcode: Two Sum

Question

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

Hide Tags Array Hash Table
Hide Similar Problems (M) 3Sum (M) 4Sum (M) Two Sum II - Input array is sorted (E) Two Sum III - Data structure design

---

Solution

It traverses all elems in nums, if (target - elem) is not in the hash_map, add it. For each elem so far, add it into the hash map.

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """

        nums_set = set(nums)

        for index, num in enumerate(nums):
            if target-num in nums_set and target-num in nums[index+1:]:
                return [index+1, nums[index+1:].index(target-num) + index+2]

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

    }
};

---

Another solution

Another solution is to sort nums first, and uses two pointers to find res.