LeetCode 1. two sum

twosum.java

class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> h = new HashMap<Integer, Integer>();
        
        int i = 0;
        for(; i< nums.length; i++){
            if(h.get(nums[i]) == null){
                h.put(target-nums[i], i);
            }else{
                break;
            }
        }
        return new int[] {i, h.get(nums[i])};
    }
}