求数组中两个元素加起来等于指定的数

1.问题描述

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

2.解题：

 public static int[] twoSum(int[] nums, int target) {
        for (int i =0;i<nums.length;i++){
            for (int j =(i + 1);j<nums.length;j++){
                if ((nums[i] + nums[j]) == target){
                    return new int[] { i, j};
                }
            }
        }
        return retInt;
    }

方法比较简单，但是时间复杂度估计是最差的了 O(n2)，更改为

 public static 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);
    }
  }
  // I==0的时候想大于初始化Map