LeetCode 15 3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

• Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
• The solution set must not contain duplicate triplets.

    For example, given array S = {-1 0 1 2 -1 -4},

    A solution set is:
    (-1, 0, 1)
    (-1, -1, 2)

先对数组进行排序，然后确定第一个数，根据第一个数确定第二个数和第三个数，具体请读代码，代码思路还是很简单清晰的：

	public List<List<Integer>> threeSum(int[] nums) {
		List<List<Integer>> result = new LinkedList<List<Integer>>();
		int len = nums.length;
		Arrays.sort(nums);
		for (int i = 0; i < len - 2 && nums[i] <= 0; i++) {
			if (i > 0 && nums[i] == nums[i - 1]) continue;
			int left = i + 1, right = len - 1;
			while (left < right) {
				if (nums[i] + nums[left] + nums[right] == 0) {
					List<Integer> list = new ArrayList<Integer>();
					list.add(nums[i]);
					list.add(nums[left]);
					list.add(nums[right]);
					result.add(list);
					/**去掉重复的数据,并且继续收缩找中间的数据*/
					while (left++ < right && nums[left] == nums[left - 1]) ;
					while (left < --right && nums[right] == nums[right + 1]) ;
				} else if (nums[i] + nums[left] + nums[right] < 0)
					left++;//数据小,继续找后边大的数据.
				else right--;//数据大,继续找前边小的数据.

			}
		}
		return result;
	}