Leetcode#18 4Sum

原创 2015年07月09日 23:57:01

Given an array S of n integers, are there elements abc, 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)

Difficulty: Medium

思路不是很难,可是Debug真是一件无比痛!苦!的事,足足花了我两个小时,可能还是不够熟练吧。

vector<vector<int> > fourSum(vector<int>& nums, int target) {
       vector<vector<int> > ans;
       int len = nums.size();
       if(len<4)
        return ans;
        sort(nums.begin(),nums.end());
       for(int p1 = 0; p1<len-3;p1++)
      {
        for(int p4 = p1+1; p4<len-2; p4++)
       {
           int p2 = p4+1, p3 = len-1;
           if(nums[p4]==nums[p4-1]&&p4-1>p1)
            continue;
        if(nums[p1]==nums[p1-1]&&p1>0)
            continue;
           while(p3>p2)
           {
               int target2 = target - nums[p1] - nums[p4];

               if(nums[p2]==nums[p2-1]&&p2-1>p4)
               {
                   p2++;
                   continue;
               }

               if(nums[p3]==nums[p3+1]&&p3+1<len-1)
               {
                   p3--;
                   continue;
               }

               if(nums[p3]+nums[p2]>target2)
               {
                   p3--;
                   continue;
               }
               else if(nums[p3]+nums[p2]<target2)
               {
                   p2++;
                   continue;
               }
               else
               {
                   vector<int> tmp;
                   int test;
                    tmp.push_back(nums[p1]);
                    tmp.push_back(nums[p4]);
                    tmp.push_back(nums[p2]);
                    tmp.push_back(nums[p3]);
                    ans.push_back(tmp);
                    p2++;
                    continue;
               }
           }


       }
}
        return ans;
    }



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

(LeetCode 18) 4Sum

Q: Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d =...

LeetCode No.18 4Sum

LeetCode No.18 4Sum

leetcode18 4sum

题目: Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + ...

【leetcode】Array——4Sum(18)

题目:Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d...

[LeetCode18]4Sum

4Sum Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d ...
  • sbitswc
  • sbitswc
  • 2014年06月05日 23:20
  • 532

leetcode 18 -- 4Sum

4Sum 题目:Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c...

leetcode 18. 4Sum

题意 找四个不重复的数,使他们相加结果为给定的target 题解 将数组排序后,枚举两个不重复的元素A和B,然后用binary_search函数二分查找剩余值(剩余值通过枚举任意两数相加的和形...

LeetCode之18_4Sum

题目原文: Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + ...

【LeetCode】18. 4Sum

18. 4Sum题目描述Given an array S of n integers, are there elements a, b, c, and d in S such that a + b +...

LeetCode 18 4Sum (C,C++,Java,Python)

Problem: Given an array S of n integers, are there elements a, b, c, and d in S such that a + b...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Leetcode#18 4Sum
举报原因:
原因补充:

(最多只允许输入30个字)