https://leetcode.com/problems/two-sum/description/
public int[] twoSum(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}; } } } throw new IllegalArgumentException("No two sum solution"); } public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> test = new HashMap<>(); for(int i=0;i<nums.length;i++){ int a=target-nums[i]; if(test.containsKey(a) && test.get(a)<i) return new int[]{test.get(a),i}; test.put(nums[i],i); } throw new IllegalArgumentException("No two sum solution"); }