package leetcode;import java.util.HashMap;import java.util.Map;/** * @author mercy *Example: *Given nums = [2, 7, 11, 15], target = 9, *Because nums[0] + nums[1] = 2 + 7 = 9, *return [0, 1]. */public class TwoSum {	public static void main(String[] args) { int[] nums={ 2,0,4,9,5,7,10,9}; int target=12; int[] arr=twoSum1(nums,target); System.out.println(arr[0]+"--"+arr[1]); } public static int[] twoSum(int[] nums, int target) { Map
    
      map=new HashMap<>(); for(int i=0;i
     
       map=new HashMap<>(); for(int i=0;i