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

Code

public class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer,Integer> map = new HashMap<>();//HashMap查值 for(int i=0;i<nums.length;i++){ Integer index = map.get(target-nums[i]); if(index==null){ map.put(nums[i],i); } else{ return new int[]{index,i}; } } return new int[]{0,0}; } }

转载于:https://www.cnblogs.com/bingo2-here/p/7131791.html