leetcode-18. 四数之和

给你一个由 n 个整数组成的数组 nums ，和一个目标值 target 。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]] （若两个四元组元素一一对应，则认为两个四元组重复）：

0 <= a, b, c, d < n
a、b、c 和 d 互不相同
nums[a] + nums[b] + nums[c] + nums[d] == target
你可以按 任意顺序 返回答案 。

示例 1：
输入：nums = [1,0,-1,0,-2,2], target = 0
输出：[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
		int len = nums.size();
		vector<vector<int>> res;
        long long int tmp1, tmp2, tmp3;

        if(len < 4) return res;

		sort(nums.begin(), nums.end());
		
		//最小的四个/最大的四个
        tmp1 = (long long int)nums[0] + (long long int)nums[1] + (long long int)nums[2] + (long long int)nums[3];
        tmp2 = (long long int)nums[len - 4] + (long long int)nums[len - 3] + (long long int)nums[len - 2] + (long long int)nums[len - 1];
		if(tmp1 > target || tmp2 < target)
			return res;

		int i = 0;
		while(i < len - 3) {
			long long int sum1 = target - nums[i];

            tmp1 = (long long int)nums[i + 1] + (long long int)nums[i + 2] + (long long int)nums[i + 3];
			if (tmp1 > sum1) {
				break;
			}

			int j = i + 1;
			while(j < len - 2) {
				long long int sum2 = sum1 - nums[j];
				int le = j + 1;
				int ri = len - 1;

				tmp2 = (long long int)nums[j+1] + (long long int)nums[j+2];
				if (tmp2 > sum2) {
					break;
				}

				while(le < ri) {
					vector<int> tmp;
					tmp3 = (long long int)nums[le] + (long long int)nums[ri];
					if(tmp3 < sum2) {
						le++;
						while(le < ri && nums[le] == nums[le-1])
							le++;
					} else if (nums[le] + nums[ri] > sum2) {
						ri--;
						while(le < ri && nums[ri] == nums[ri+1])
							ri--;
					} else {
						tmp.push_back(nums[i]);
						tmp.push_back(nums[j]);
						tmp.push_back(nums[le]);
						tmp.push_back(nums[ri]);
						res.push_back(tmp);

						le++;
						while(le < ri && nums[le] == nums[le-1])
							le++;

						ri--;
						while(le < ri && nums[ri] == nums[ri+1])
							ri--;
					}
				}
				
				j++;
				while(j < len - 2 && nums[j] == nums[j-1])
					j++;
			}

			i++;
			while(i < len - 3 && nums[i] == nums[i-1])
				i++;
		}
		
		return res;
    }
};