[LeetCode] Two Sum

class Solution {
    public int[] twoSum(int[] nums, int target) {
        
		 Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		 int[] result = new int[2];
		 int rest = 0;
		 
		 for (int i = 0; i < nums.length; i++) {
			map.put(nums[i], i);			
		 }		
			 		
		for (int i = 0; i < nums.length; i++) {
			rest = target - nums[i];	
			if(map.containsKey(rest)) {
				result[0] = i;
				if(map.get(rest) != i)
					result[1] = map.get(rest);
				else
					continue;
				
				break;
			}
		}		
		return result;
    }
}