leetCode练习（18）

题目：Submission Details

难度：medium

问题描述：

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: 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]
]

解题思路（1）：一开始没有仔细考虑问题的解题技巧，只想着使用枚举穷尽所有可能，找到满足条件的集合并且剔除重复的集合，这样就能解决问题。忽略了算法复杂度，套用了四层循环，计算量巨大，代码如下：

public class Solution {
    public List
   
   
    
    
     
     > fourSum(int[] nums, int target) {
       List
     
     
      
      
       
       > list=new LinkedList
       
        
        
          >(); LinkedList 
         
           listtemp=new LinkedList 
          
            (); boolean flag=false; int num=0; if(nums.length<4){ return list; } int len=nums.length; int a,b,c,d; for(a=0;a 
           
             temp=new LinkedList<>(); temp.add(nums[a]); temp.add(nums[b]); temp.add(nums[c]); temp.add(nums[d]); listtemp.add(inttemp); list.add(temp); num++; // System.out.println("最终——————————————————"+nums[a]+":"+nums[b]+":"+nums[c]+":"+nums[d]); }else{ flag=false; } } } } } } return list; } public static boolean isequal(int[]a,int[]b){ HashMap 
            
              temp1=new HashMap 
             
               (); HashMap 
              
                temp2=new HashMap 
               
                 (); for(int i=0;i<4;i++){ if(temp1.containsKey(a[i])){ temp1.put(a[i], temp1.get(a[i])+1); }else{ temp1.put(a[i], 1); } } for(int i=0;i<4;i++){ if(temp2.containsKey(b[i])){ temp2.put(b[i], temp2.get(b[i])+1); }else{ temp2.put(b[i], 1); } } for(int i=0;i<4;i++){ int k=a[i]; if(temp1.get(k)!=temp2.get(k)){ return false; } } return true; } } 
                
               
              
             
            
           
          
         
       
      
      
     
     
    
    
   
   

解题思路（2）：在上个代码片段提交了之后，leetCode编译后显示时间超时，想想也是，这么暴力的方法确实毫无可取之处，然后参考了他山之石，关键在于对数据进行必要的预处理，排序后再操作可以减少巨量的复杂度。具体代码如下：

 
 

  
  
public class Solution {
   public List
    
    
     
     
      
      > fourSum(int[] nums, int target) {
		ArrayList
      
      
       
       
        
        > res = new ArrayList
        
         
         
           >(); int len = nums.length; if (nums == null || len < 4) return res; Arrays.sort(nums); int max = nums[len - 1]; if (4 * nums[0] > target || 4 * max < target) return res; int i, z; for (i = 0; i < len; i++) { z = nums[i]; if (i > 0 && z == nums[i - 1])// avoid duplicate continue; if (z + 3 * max < target) // z is too small continue; if (4 * z > target) // z is too large break; if (4 * z == target) { // z is the boundary if (i + 3 < len && nums[i + 3] == z) res.add(Arrays.asList(z, z, z, z)); break; } threeSumForFourSum(nums, target - z, i + 1, len - 1, res, z); } return res; } /* * Find all possible distinguished three numbers adding up to the target * in sorted array nums[] between indices low and high. If there are, * add all of them into the ArrayList fourSumList, using * fourSumList.add(Arrays.asList(z1, the three numbers)) */ public void threeSumForFourSum(int[] nums, int target, int low, int high, ArrayList 
           
           
             > fourSumList, int z1) { if (low + 1 >= high) return; int max = nums[high]; if (3 * nums[low] > target || 3 * max < target) return; int i, z; for (i = low; i < high - 1; i++) { z = nums[i]; if (i > low && z == nums[i - 1]) // avoid duplicate continue; if (z + 2 * max < target) // z is too small continue; if (3 * z > target) // z is too large break; if (3 * z == target) { // z is the boundary if (i + 1 < high && nums[i + 2] == z) fourSumList.add(Arrays.asList(z1, z, z, z)); break; } twoSumForFourSum(nums, target - z, i + 1, high, fourSumList, z1, z); } } /* * Find all possible distinguished two numbers adding up to the target * in sorted array nums[] between indices low and high. If there are, * add all of them into the ArrayList fourSumList, using * fourSumList.add(Arrays.asList(z1, z2, the two numbers)) */ public void twoSumForFourSum(int[] nums, int target, int low, int high, ArrayList 
             
             
               > fourSumList, int z1, int z2) { if (low >= high) return; if (2 * nums[low] > target || 2 * nums[high] < target) return; int i = low, j = high, sum, x; while (i < j) { sum = nums[i] + nums[j]; if (sum == target) { fourSumList.add(Arrays.asList(z1, z2, nums[i], nums[j])); x = nums[i]; while (++i < j && x == nums[i]) // avoid duplicate ; x = nums[j]; while (i < --j && x == nums[j]) // avoid duplicate ; } if (sum < target) i++; if (sum > target) j--; } return; } }