Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
public class Solution { public int[] twoSum(int[] numbers, int target) { // Start typing your Java solution below // DO NOT write main() function int[] result = new int[2]; HashMap<Integer,Integer> hash = new HashMap<Integer,Integer>(); for(int i = 0; i < numbers.length;i++){ hash.put(numbers[i],i); } for(int i = 0; i < numbers.length;i++){ int num = target - numbers[i]; if(hash.containsKey(num)){ int index2 = hash.get(num); if(index2 > i){ ／／ ｗｒｏｎｇ ｈｅｒｅ！！！ ｔａｋｅ ｃａｒｅ ｏｆ ｏｒｄｅｒ！！！ result[0] = i+1; result[1] = index2+1; } } } return result; } }
mistakes: 1) forgot to put Key-value to hash map