给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。 你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。 示例: 给定 nums = [2, 7, 11, 15], target = 9 因为 nums[0] + nums[1] = 2 + 7 = 9 所以返回 [0, 1]
class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer,Integer> map=new HashMap<>();
for (int i = 0; i <nums.length ; i++) {
int another=target-nums[i];
if(map.containsKey(another)){//nums的值做key,下标做value
return new int[]{map.get(another),i};//有就直接返回下标。
}
map.put(nums[i],i);//没有则加入到map中
}
throw new RuntimeException("No two sum solution");
}
}
public class Main {
public static void main(String[] args) {
int[] nums = {2, 7, 11, 15};
int target = 9;
Solution solution=new Solution();
System.out.println(Arrays.toString(solution.twoSum(nums,target)));
int [] a = new int[5];
int [] b = {1,45,65,345};
String[] c = {"dewd","fwefew","fewf"};
for(int i = 0; i < 5; i ++){
a[i] = i;
}
System.out.println("数组B: " +Arrays.toString(b));
System.out.println("字符串C: " +Arrays.toString(c));
System.out.println("字符串C: " +Arrays.asList(c));
}
}