leetcode--1--two sum

two sum

https://leetcode.com/problems/two-sum/#/description

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].

ANSWER 1: JAVA O(N)

public int[] twoSum(int[] nums, int target) {  
    Map<Integer, Integer> map = new HashMap<>();  
    for (int i = 0; i < nums.length; i++) {  
        map.put(nums[i], i);  
    }  
    for (int i = 0; i < nums.length; i++) {  
        int complement = target - nums[i];  
        if (map.containsKey(complement) && map.get(complement) != i) {  
            return new int[] { i, map.get(complement) };  
        }  
    }  
    throw new IllegalArgumentException("No two sum solution");  
}

ANSWER 2: JAVA O(N)

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int complement = target - nums[i];
        if (map.containsKey(complement)) {
            return new int[] { map.get(complement), i };
        }
        map.put(nums[i], i);
    }
    throw new IllegalArgumentException("No two sum solution");
}

ANSWER 3: C++  O(N)

https://discuss.leetcode.com/topic/3294/accepted-c-o-n-solution

 

vector<int> twoSum(vector<int> &numbers, int target)
{
    //Key is the number and value is its index in the vector.
	unordered_map<int, int> hash;
	vector<int> result;
	for (int i = 0; i < numbers.size(); i++) {
		int numberToFind = target - numbers[i];

            //if numberToFind is found in map, return them
		if (hash.find(numberToFind) != hash.end()) {
           	result.push_back(hash[numberToFind] );
			result.push_back(i );			
			return result;
		}

            //number was not found. Put it in the map.
		hash[numbers[i]] = i;
	}
	return result;
}

ANSWER 3: Phthon  O(N)

https://discuss.leetcode.com/topic/10725/python-solution-using-hash

 def twoSum(self, nums, target):
        map = {}
        for i in range(len(nums)):
            if nums[i] not in map:
                map[target - nums[i]] = i 
            else:
                return map[nums[i]], i 

        return -1, -1

思路：

题目默认最多只有一组答案，问题变得简单，将没有匹配成功的元素放进去hashmap，如果能匹配的元素序号是

 i  和j（i<j），那么轮到 i 的时候，hashmap中已经存在的元素序号是0 到 i-1 

不会匹配成功，i 最终会放入 hashmap，轮到 j 的时候，从hashmap中查找，就肯定能找到一个匹配元素，即i