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)

解题思路：

详见3Sum，思路完全一样。

代码：

    public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if (num.length < 4)
            return result;
        insertSort(num, num.length);
        for (int i = 0; i < num.length; i++) {
            if (i != 0 && num[i] == num[i - 1])
                continue;
            for (int j = i + 1; j < num.length; j++) {
                if (j != i + 1 && num[j] == num[j - 1])
                    continue;
                int p = j + 1;
                int q = num.length - 1;
                int sum;
                while (p < q) {
                    if (p > j + 1 && num[p - 1] == num[p]) {
                        p++;
                        continue;
                    }
                    if (q < num.length - 1 && num[q] == num[q + 1]) {
                        q--;
                        continue;
                    }
                    sum = num[i] + num[j] + num[p] + num[q];
                    if (sum == target) {
                        ArrayList<Integer> newList = new ArrayList<Integer>();
                        int[] four = {num[i], num[j], num[p], num[q]};
                        insertSort(four, 4);
                        newList.add(four[0]);
                        newList.add(four[1]);
                        newList.add(four[2]);
                        newList.add(four[3]);
                        result.add(newList);
                        q--;//p++
                    } else if (sum < target)
                        p++;
                    else
                        q--;
                }
            }
        }
        return result;
    }

    public void insertSort(int[] list, int n) {
        int temp;
        for (int i = 1; i < n; i++) {
            temp = list[i];
            int j;
            for (j = i; j > 0 && temp < list[j - 1]; j--)
                list[j] = list[j - 1];
            list[j] = temp;
        }
    }