TwoSum-Leetcode

Question :

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].

My solution :

public class Solution {
    public int[] twoSum(int[] nums, int target) {
    	
    	int arr[] = {0, 0};
    	
        for(int i = 0; i < nums.length; i++) {
        	for (int j = i + 1; j < nums.length; j ++) {
        		if ((nums[i] + nums[j]) == target) {
        			arr[0] = i;
        			arr[1] = j;
        			return arr;
        		}
        	}
        }
        
	return arr;
    }
}

Better Solution :

import java.util.HashMap;

public class Solution_HashTable {
public int[] twoSum(int[] nums, int target) {
    	HashMap<Integer, Integer> nums_hash = new HashMap<Integer, Integer>();
    	
    	for (int i = 0; i < nums.length; i++) {
    		nums_hash.put(nums[i], i);
    	}
    	
    	for (int i = 0; i < nums.length; i++) {
    		int complement = target - nums[i];
    		
    		if (nums_hash.containsKey(complement) && nums_hash.get(complement) != i) {
    			return new int[]{i, nums_hash.get(complement)};
    		}
    	}
    	
    	throw new IllegalArgumentException("No two sum solution");
    }
}

自己的方法过于简单， 时间复杂度为O（n^2）

更好的解法中使用了HashMap, 使得查找另一个数更快

 Time complexity : O(n). We traverse the list containing $n$ elements exactly twice. Since the hash table reduces the look up time to $O(1)$, the time complexity is O(n）.

• Space complexity : O(n). The extra space required depends on the number of items stored in the hash table, which stores exactly $n$ elements.