Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Solution1
Brute Force
1 | public int[] twoSum(int[] nums, int target) { |
Solution2
HashMap
1 | public int[] twoSum(int[] nums, int target) { |