import java.util.HashMap;

import java.util.Map;

public class Sol35229 {

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

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

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

if (nums[i]+nums[j] == target) {

return new int[]{i, j};

}

}

}

return new int[] {};

}

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

Map<Integer, Integer> hashMap = new HashMap<>();

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

hashMap.put(nums[i], i);

}

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

int complement = target - nums[i];

if (hashMap.containsKey(complement) && hashMap.get(complement) != i) {

return new int[]{i, hashMap.get(complement)};

}

}

return new int[] {};

}

}