Leetcode 1 Two sum Java__java

Given an array of integers, find two numbers such this they add up to a specific target number.

The function twosum should return indices of the two numbers such this they add up to the target where index1 must is Les S than Index2. Please note this your returned answers (both INDEX1 and index2) are not zero-based.

You may assume this each input would have exactly one solution.

Input:numbers={2, 7, one, target=9
Output:index1=1, index2=2

Space Exchange Time:

Program Transfer from: Https://leetcode.com/discuss/41366/my-short-java-solution-o-n-hashmap

public class Solution {public int[] twosum (int[] nums, int target) {Hashmap<inte
        GER, Integer> tracker = new Hashmap<integer, integer> ();
        int len = nums.length; for (int i = 0; i < len; i++) {if (Tracker.containskey (nums[i))} {int left = Tracker.get (nums
                [i]);
            return new int[]{left+1, i+1};
            }else{Tracker.put (Target-nums[i], i);
    } return to new int[2]; }
}