leetcode-15-三数之和

https://leetcode-cn.com/problems/3sum/solution/pai-xu-shuang-zhi-zhen-zhu-xing-jie-shi-python3-by/

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

class Solution {
	public static List<List<Integer>> threeSum(int[] nums) {
		// base case and init
		List<List<Integer>> ans = new ArrayList();
		int len = nums.length;
		if (nums == null || len < 3)
			return ans;
		Arrays.sort(nums);// sort
		// core
		for (int i = 0; i < len; i++) {
			if (nums[i] > 0)// sum>0
				break;
			if (i > 0 && nums[i] == nums[i - 1])// unique
				continue;
			// double pointer
			int L = i + 1;
			int R = len - 1;
			while (L < R) {
				int sum = nums[i] + nums[L] + nums[R];
				if (sum == 0) {
					ans.add(Arrays.asList(nums[i], nums[L], nums[R]));
					while (L < R && nums[L] == nums[L + 1])
						L++; // unique
					while (L < R && nums[R] == nums[R - 1])
						R--; // unique
					L++;
					R--;
				} else if (sum < 0)
					L++;
				else if (sum > 0)
					R--;
			}
		}
		return ans;
	}
}