找出数组中相加之和等于特定值的四个数

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

public class Solution {
    //解法1
    public List<List<Integer>> fourSum1(int[] nums, int target) {
        if (nums == null || nums.length < 4)
            return new ArrayList<>();
        Arrays.parallelSort(nums);
        List<List<Integer>> result = new ArrayList<>();
        int mid2, end, sum;
        for (int i = 0; i <= nums.length - 4; i++) {
            if (i > 0 && nums[i] == nums[i - 1])
                continue;
            for (int j = i + 1; j <= nums.length - 3; j++) {
                if (j > i + 1 && nums[j] == nums[j - 1])
                    continue;
                mid2 = j + 1;
                end = nums.length - 1;
                while (mid2 < end) {
                    sum = nums[i] + nums[j] + nums[mid2] + nums[end];
                    if (sum == target) {
                        result.add(Arrays.asList(nums[i], nums[j], nums[mid2], nums[end]));
                        while (mid2 < end && nums[mid2] == nums[mid2 + 1])
                            mid2++;
                        while (mid2 < end && nums[end] == nums[end - 1])
                            end--;
                        mid2++;
                        end--;
                    } else if (sum > target) {
                        end--;
                    } else {
                        mid2++;
                    }
                }
            }
        }
        return result;
    }

    //解法2
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> result = new ArrayList<>();
        if (nums == null || nums.length < 4)
            return result;

        int len = nums.length;
        Arrays.parallelSort(nums);
        if (4 * nums[0] > target || 4 * nums[len - 1] < target)
            return result;

        int z, max = nums[len - 1];
        for (int i = 0; i < len; i++) {
            z = nums[i];
            if (4 * z > target)
                break;

            if (i > 0 && nums[i] == nums[i - 1])
                continue;
            if (z + 3 * max < target)
                continue;
            if (4 * z == target) {
                if (i + 3 < len && nums[i + 3] == z) {
                    result.add(Arrays.asList(z, z, z, z));
                }
                break;
            }
            if (i + 1 < len - 1) {
                threeSum(nums, target - z, i + 1, len - 1, result, z);
            } else {
                break;
            }
        }
        return result;
    }

    public void threeSum(int[] nums, int target, int low, int high, List<List<Integer>> result, int z1) {
        int max = nums[high];
        if (3 * max < target || 3 * nums[0] > target)
            return;
        int z;
        for (int i = low; i <= high; i++) {
            z = nums[i];
            if (3 * z > target)
                break;
            if (i > low && nums[i] == nums[i - 1])
                continue;
            if (z + 2 * max < target)
                continue;
            if (3 * z == target) {
                if (i + 2 <= high && nums[i + 2] == z) {
                    result.add(Arrays.asList(z1, z, z, z));
                }
                break;
            }
            if (i + 1 < high) {
                twoSum(nums, target - z, i + 1, high, result, z1, z);
            } else {
                break;
            }
        }
    }

    public void twoSum(int[] nums, int target, int i, int j, List<List<Integer>> result, int z1, int z2) {
        int sum;
        while (i < j) {
            sum = nums[i] + nums[j];
            if (sum == target) {
                result.add(Arrays.asList(z1, z2, nums[i], nums[j]));
                while (i < j && nums[i] == nums[i + 1])
                    i++;
                while (i < j && nums[j] == nums[j - 1])
                    j--;
                i++;
                j--;
            } else if (sum < target) {
                i++;
            } else {
                j--;
            }
        }
    }

    public static void main(String[] args) {
        int[] nums = {2, 1, 0, -1};
        int target = 2;
        System.out.println(new Solution().fourSum(nums, target));
    }
}

[参考资料]https://discuss.leetcode.com/topic/26050/simple-o-n-2-two-pointers-java-solution
https://discuss.leetcode.com/topic/29585/7ms-java-code-win-over-100

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值