Leetcode--Java--1. Two Sum

题目描述

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

样例描述

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]
 

Constraints:

2 <= nums.length <= 103
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.

思路

这题可以暴力做，就是用两个for循环，分别遍历i，j找到符合条件的。但这样时间复杂度是O(n^2)太高。 所以用另外一种做法：
利用HashMap的特性实现，把这个数和他的下标作为一对键值对放入map，然后遍历数组，每次判断和这个数配对的数是否在数组中，在的话直接返回，注意是返回数组形式，故要用new int[ ]创建。 不在的话，就把这个键值对加入到map中

代码

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