LeetCode | 4Sum

题目

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

Note:

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

    For example, given array S = {1 0 -1 0 -2 2}, and target = 0.

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

分析

注意去重，k-Sum都是一个套路。

代码

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

public class FourSum {
	public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {
		ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();
		if (num == null || num.length < 4) {
			return results;
		}
		Arrays.sort(num);
		int N = num.length;
		for (int i = 0; i < N - 3; ++i) {
			if (i > 0 && num[i] == num[i - 1]) {
				continue;
			}
			for (int j = i + 1; j < N - 2; ++j) {
				if (j > i + 1 && num[j] == num[j - 1]) {
					continue;
				}
				int k = j + 1;
				int l = N - 1;
				while (k < l) {
					if (k > j + 1 && num[k] == num[k - 1]) {
						++k;
						continue;
					}
					if (l < N - 1 && num[l] == num[l + 1]) {
						--l;
						continue;
					}
					int sum = num[i] + num[j] + num[k] + num[l];
					if (sum < target) {
						++k;
					} else if (sum > target) {
						--l;
					} else {
						ArrayList<Integer> list = new ArrayList<Integer>();
						list.add(num[i]);
						list.add(num[j]);
						list.add(num[k]);
						list.add(num[l]);
						results.add(list);
						++k;
					}
				}
			}
		}
		return results;
	}
}