【LeetCode】18.四数之和

【LeetCode刷题 18.四数之和】

题目难度：中等

---

题目描述

思路：枚举剪枝+双指针减小时间复杂度

class Solution {
public:
	vector<vector<int>> fourSum(vector<int>& nums, int target) {
		vector<vector<int>> res;
		if (nums.size() < 4) return res;
		
		// 1. 排序
		sort(nums.begin(), nums.end());

		// 枚举第一个数
		int len = nums.size();
		for (int i = 0; i < len - 3; ++i) {
			// 剪枝
			if (i > 0 && nums[i] == nums[i-1]) continue;
			if ((long) nums[i]+nums[i-3]+nums[i-2]+nums[i-1] > target) break;
			if ((long) nums[i]+nums[len-3]+nums[len-2]+nums[len-1] < traget) continue;

			// 枚举第二个数
			for (int j = i + 1; j < len - 2; ++j) {
				// 剪枝
				if (j > i + 1 && nums[j] == nums[j-1]) continue;
				if ((long) nums[i]+nums[j]+nums[j+1]+nums[j+2] > target) break;
				if ((long) nums[i]+nums[j]+nums[len-2]+nums[len-1] < target) continue;

				int l = j + 1, r = len - 1;
				while (l < r) {
					long sum = (long) nums[i]+nums[j]+nums[l]+nums[r];
					if (sum == target) {
						res.push_back({nums[i], nums[j], nums[l], nums[r]});

						while (l < r && nums[l] == nums[l+1]) l++;
						l++;
						while (l < r && nums[r] == nums[r-1]) r--;
						r--; 
					} else if (sum > target) r--;
					else l++; 
				} 
			}
		}
		return res;
	}
};

---