clueless coding // TODO: be smarter

LeetCode Two Sum: Java Solution



TL;DR Code Solution


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

    HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
    int[] res = new int[2];

    for (int i = 0; i < nums.length; i++) {

        if (map.containsKey(target - nums[i])) {
            res[0] = map.get(target - nums[i]);
            res[1] = i;
            return res;
        }

        else {
            map.put(nums[i], i);
        }


    }

    return res;

}