zoukankan      html  css  js  c++  java
  • [leetcode]18. 4Sum四数之和

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

    Note:

    The solution set must not contain duplicate quadruplets.

    Example:

    Given array nums = [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]
    ]

    题目

    思路

    1. Sort the array (coz we need to check the duplicates) 

    2. Lock two pointer on left most side and do two sum with the other two in the remaing

    代码

     1 class Solution {
     2        public List<List<Integer>> fourSum(int[] nums, int target) {
     3         List<List<Integer>> result = new ArrayList<>();
     4         if (nums.length < 4) return result;
     5         Arrays.sort(nums);
     6         for (int i = 0; i < nums.length - 3; ++i) {
     7             if (i > 0 && nums[i] == nums[i-1]) continue;
     8             for (int j = i + 1; j < nums.length - 2; ++j) {
     9                 if (j > i+1 && nums[j] == nums[j-1]) continue;
    10                 int k = j + 1;
    11                 int l = nums.length - 1;
    12                 while (k < l) {
    13                     final int sum = nums[i] + nums[j] + nums[k] + nums[l];
    14                     if (sum < target) {
    15                         ++k;
    16                         while(nums[k] == nums[k-1] && k < l) ++k;
    17                     } else if (sum > target) {
    18                         --l;
    19                         while(nums[l] == nums[l+1] && k < l) --l;
    20                     } else {
    21                         result.add(Arrays.asList(nums[i], nums[j], nums[k], nums[l]));
    22                         ++k;
    23                         --l;
    24                         while(nums[k] == nums[k-1] && k < l) ++k;
    25                         while(nums[l] == nums[l+1] && k < l) --l;
    26                     }
    27                 }
    28             }
    29         }
    30         return result;
    31     }
    32 }
  • 相关阅读:
    JavaWeb--JDBC
    JavaWeb--过滤器、监听器
    Javaweb-MVC三层架构
    JavaWeb--JSP
    JavaWeb--Cookie、Session
    JavaWeb--Servlet
    实用记录文档
    分库分表Sharding-JDBC + MyBatis-Plus动态表名
    如何不靠运气变得富有 (九) —— 互联网极大地丰富了职业发展的可能性
    如何不靠运气变得富有 (八) —— 给社会提供它不知道如何获得的东西
  • 原文地址:https://www.cnblogs.com/liuliu5151/p/9823974.html
Copyright © 2011-2022 走看看