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

时间复杂度：

• 暴力搜索：O（n^2）
• 采用哈希搜索法：O（n）

python可利用字典，建立的索引为key-value:数值-索引

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dict = {}
        for i in range(len(nums)):
            if (target - nums[i]) in dict:
                return [dict[target - nums[i]], i]
            dict[nums[i]] = i
        return []

Java版本：使用Java的Map做hash索引

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] results = new int[2];
        if(nums == null || nums.length < 2)
            return results;
        Map<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < nums.length; i++)
        {
            if(map.containsKey(target - nums[i])) {
                results[1] = i;
                results[0] = map.get(target - nums[i]);
            }
            map.put(nums[i], i);
        }
        return results;
    }
}