【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]. 
给定一个整数数组，返回两个数字的索引，使它们相加到一个特定的目标。

您可以假设每个输入都将具有一个解决方案，而您可能不会使用相同的元素两次。

例： 
给定nums = [2，7，11，15]，target = 9，

因为nums [0] + nums [1] = 2 + 7 = 9， 
返回[0，1]。

主要的思路是用HashMap

1 2 3 4 5 6 7 8 9 10 11 12 13 14

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