Leetcode Day1

twosum

用HashMap

import java.util.HashMap;

public class twoSum1 {

	public static void main(String[] args) {
		int[]num=new int []{4,2,7,5};
		int tag=9;
		int []a=twoSum(num,tag);
		 for (int each : a) {
	            System.out.println(each);
	        }
	}
	    public static int[] twoSum(int[] nums, int target) {
	    	int []a=new int[2];
	        HashMap<Integer, Integer> result = new HashMap<>();
	        for (int i = 0; i < nums.length; i++) {
	            result.put(nums[i], i);
	        }
	 
	        for (int i = 0; i < nums.length; i++) {
	            int com = target - nums[i];
	            if (result.containsKey(com) && result.get(com) != i) {
	             a= new int[] {i, result.get(com)};
	             return a;
	            }
	        }
			return a;
	

	}

}