3Sum
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Solution1
Brute Force
1 | public int[] twoSum(int[] nums, int target) { |
Solution2
HashMap
1 | public int[] twoSum(int[] nums, int target) { |