给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。
示例:
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
package com.ljm.easy.onetofifty;
import java.util.HashMap;
import java.util.Map;
/**
* Created by linjiaming
*
*
* 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].
*
* 来源:力扣(LeetCode)
* 链接:https://leetcode-cn.com/problems/two-sum
* 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
*
*/
public class TwoSum {
/**
* 方法一:暴力破解
* @param nums
* @param target
* @return
*/
public static int[] twoSum1(int[] nums, int target) {
for (int i = 0; i < nums.length; i++) {
for (int j = i + 1; j < nums.length; j++) {
if (nums[j] == target - nums[i]) {
return new int[]{i, j};
}
}
}
return null;
}
/**
* 方法二:哈希映射,相较于方法一时间复杂度较低
* @param nums
* @param target
* @return
*/
public static int[] twoSum2(int[] nums, int target){
Map<Integer, Integer> map = new HashMap<Integer, Integer>(16);
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(target - nums[i])) {
return new int[]{map.get((target - nums[i])), i};
}
map.put(nums[i],i);
}
return null;
}
public static void main(String[] args) {
int[] value = twoSum2(new int[]{2, 7, 11, 15}, 9);
System.out.println(value.toString());
}
}