LeetCode 1、Two Sum

package com;

import java.util.Arrays;
import java.util.HashMap;

/**
* Created by hms on 2016/12/22.
*/
public class Solution {
public int[] twoSum(int[] nums, int target) {
int index[] = {0, 0};
HashMap<Integer, Integer> hashMap = new HashMap<Integer, Integer>();
int n = nums.length;
for(int i = 0; i < n; ++i){
if(hashMap.containsKey(nums[i])){
if(nums[i] == target - nums[i]){
int k = hashMap.get(nums[i]);
index[0] = k;
index[1] = i;
return index;
}
}else {
if(hashMap.containsKey(target-nums[i])){
int k = hashMap.get(target-nums[i]);
index[0] = k;
index[1] = i;
return index;
}
hashMap.put(nums[i], i);
}
}
return index;
}
}