[Leetcode] Two Sum

 1 import java.util.*;
 2 
 3 public class Solution {
 4     public int[] twoSum(int[] nums, int target) {
 5         Map<Integer,Integer> map = new HashMap<Integer,Integer>();
 6         int [] res = new int[2];
 7         for(int i=0;i<nums.length;i++){
 8             if(map.containsKey(target-nums[i])){
 9                 res[0]=map.get(target-nums[i])+1;
10                 res[1]=i+1;
11                 break;
12             }
13             else{
14                 map.put(nums[i],i);
15             }
16         }
17         return res;
18     }
19 }