1.Two Sum

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

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

    @Test
    public void t1() {
        TwoSum solution = new TwoSum();
        int[] arr = new int[] {2,7,11,5};
        int target = 9;
        Gson gson = new Gson();
        String s = gson.toJson(solution.twoSum(arr, target));
        System.out.println(s);
    }
}

直接用Hashmap来做。 注意这个containsKey是全局搜索，所以排除自身加自身的情况。(还是小白，从最简单的2Sum开始，刷leetcode给自己做个记录，希望可以坚持下来!）