LeetCode：Two Sum

LeetCode,Two Sum :
*Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].*

解题过程 :
如果用两个for循环来做的话很简单，但是会有很大的时间复杂度，O(n^2)，随着数组中的数增加，会越来越慢，所以用hash表来做要快很多，只要一次遍历就可以了。思路都是一样，先取数组中一个数与target相减，然后在数组中找相减的数，返回这两个数就可以了。代码如下：

public int[] twoSum(int[] nums,int target){

        Map<Integer, Integer> hashMap = new HashMap<Integer,Integer>();

        for (int i = 0; i<nums.length; i++){
            if(hashMap.containsKey(nums[i])){

                return new int[]{hashMap.get(nums[i]),i};
            }else{
                hashMap.put(nums[i], i);
                   }
        }

        return new int[]{0,0};
    }