leetcode 1

题目：Two Sum

problem:
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.

example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].

解法1:

我的方法：两次循环，复杂度为 $O(n^2)$

解法二：

方法一的主要时间损失是在查找补数的耗时，为$O(n)$，为此想到使用HashMap,可将时间复杂度降低到$O(1)$，空间复杂度为$O(n)$ 。

public class Solution {
    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");
    }
}

知识点学习：

1.定义一个HashMap:

Map <Integer, Integer> map = new HashMap<>();

2.HashMap 中的方法：

map.containsKey(element);
map.put(element);
map.get(element);