Method threeSum

leetcode/src/ThreeSum.java:3–16

(int[] nums)

/** Problem: https://leetcode.com/explore/interview/card/google/59/array-and-strings/3049/ */
class Solution {
  public List<List<Integer>> threeSum(int[] nums) {
    List<List<Integer>> results = new ArrayList<>();

    Arrays.sort(nums);

    for (int i = 0; i < nums.length; i++) {
      if (i != 0 && nums[i] == nums[i - 1]) {
        continue;
      }
      twoSum(i, nums, results);
    }

    return results;
  }

  private void twoSum(int i, int[] nums, List<List<Integer>> results) {
    int leftPointer = i + 1;