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

 

方法一、暴力解决

两层for循环（fix一个数，找是否存在另一个数能让两数之和等于target）

时间复杂度 O(n^2) 空间复杂度O(1)

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        boolean flag = false;
        for (int i=0; i< nums.length; i++){
            result[0] = i;
            for (int j=i+1; j<nums.length; j++){
                if (nums[i] + nums[j] == target){
                    result[1] = j;
                    flag = true;
                    break;
                }
            }
            if (flag){
                break;
            }
        }
        return result;
    }
}

方法二、参考了solution

 What is the best way to maintain a mapping of each element in the array to its index? A hash table.

在hash table中查找的时间是近似常数（近似是因为如果冲突产生，会降级到O(n)）

时间复杂度 O(n) 空间复杂度O(n)

class Solution {
    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 tmp = target - nums[i];
            if(map.containsKey(tmp)&&map.get(tmp)!=i){
                return new int[] {i,map.get(tmp)};
            }
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}

方法三、

边存入hashmap，边查找。

时间复杂度 O(n) 空间复杂度O(n)

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

但我这里仍然有疑问，map.put如果放在计算tmp前，就会runtime error。。。