leetcode第1题——**Two Sum

题目

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

思路

如果按照一般的思路，使用两层循环嵌套时间复杂度为O(n^2)，这会造成运行时间太长，无法通过。可以使用字典，将列表值和下标分别存储为字典的键和值，这样查找字典的时间复杂度为O(1)，只需一层循环嵌套即可，时间复杂度为O(n)，这里是牺牲了空间换时间，因为需要额外的存储和空间存储字典。

代码

Python

class Solution(object):
    # @return a tuple, (index1, index2)
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dic = {}
        size = len(nums)
        for i in range(size):
            dic[nums[i]] = i
        for i in range(size):
            if dic.get(target-nums[i]):
                return i+1,dic.get(target-nums[i])+1

Java

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