Leetcode-01 two sum

1.Given an array of integers,find two numbers such 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.

example:

Input numbers={2,7,11,15}, target = 9; output:index1 = 1,index2 = 2;

核心代码：

package com.ym.leetcode;

import java.util.HashMap;

import java.util.Map;

public class TwoNSum {

static Map<Integer, Integer> map;

public static void putData(int[] nums){
map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i);
}
}

public static int[] getResult(int[] nums, int target){
int[] result = new int[2];
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(target-nums[i])&&i!=map.get(target-nums[i])) {
result[0] = i+1;
result[1] = map.get(target-nums[i])+1;
System.out.println("found it--->"+result[0]+" "+result[1]);
return result;
}else {
System.out.println("not found!");
return result;
}
}
return result;
}

public static void main(String[] args) {
int[] nums = {3,5,8};
int target = 8;
putData(nums);
getResult(nums, target);
}

}

实现最优解