Two/Three Sum Workout
Two/Three Sum Workout https://leetcode.com/problems/two-sum/ class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> valueIndex = new HashMap<>(); for (int i = 0; i < nums.length; i++) { Integer find = valueIndex.get(target - nums[i]); if (find != null) { return new int[] {find, i}; } valueIndex.put(nums[i], i); } return new int[] {-1, -1}; } } https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ class Solution { public int[] twoSum(int[] numbers, int target) { int lo = 0; int hi = numbers.length - 1; while (lo < hi) { if (numbers[lo] + numbers[hi] == target) { return new int[] {lo + 1, hi + 1}; } else if (numbers[lo] + numbers[hi] > target) { hi--; } else { lo++; } } return new int[] {-1, -1}; } } https://leetcode.com/problems/3sum/ ...