18. 四数之和

最新推荐文章于 2023-02-09 12:02:20 发布

王蒟蒻

最新推荐文章于 2023-02-09 12:02:20 发布

阅读量221

点赞数

分类专栏： # leetcode

本文链接：https://blog.csdn.net/weixin_41413511/article/details/87969060

版权

leetcode 专栏收录该内容

26 篇文章

订阅专栏

class Solution {
public:
	vector<vector<int>> fourSum(vector<int>& nums, int target) {
		sort(nums.begin(), nums.end());
		vector<vector<int>>res;int c = nums.size();
		if (c< 4) return {};
		for (int i = 0; i < (c - 3); i++)
		{
			if (i > 0 && nums[i] == nums[i - 1])
				continue;//去重复
			for (int j = i + 1; j < (c- 2); j++)
			{
				if (j >i+1 && nums[j] == nums[j - 1])
					continue;//去重复
				int l = j + 1, r = c-1;
				while (l < r)
				{
					if (nums[i] + nums[j] + nums[l] + nums[r] == target)
					{
						res.push_back({ nums[i], nums[j], nums[l], nums[r] });
						while (l < r&&nums[l] == nums[l + 1])l++;//注意是while不是If
						while(l < r&&nums[r] == nums[r - 1])r--;
						if (l < r)//这个判断很重要
						{
							l++;r--;
						}
					}
					else if (nums[i] + nums[j] + nums[l] + nums[r] < target)
						l++;
					else 
						r--;
				}
			}
		}
		return res;
	}
};

改进版

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int>> res;
        int n = nums.size();
        if(n < 4) return res;
        sort(nums.begin(), nums.end());
        for(int i = 0; i < n - 3; i++)
        {
            if(i > 0 && nums[i] == nums[i - 1])
            {
                continue;
            }
            if(nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target)
            {
                break;
            }
            if(nums[i] + nums[n - 1] + nums[n - 2] + nums[n - 3] < target)
            {
                continue;
            }
            for(int j = i + 1; j < n - 2; j++)
            {
                if(j > i + 1 && nums[j] == nums[j - 1])
                {
                    continue;
                }
                if(nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target)
                {
                    break;
                }
                if(nums[i] + nums[j] + nums[n - 2] + nums[n - 1] < target)
                {
                    continue;
                }
                int left = j + 1;
                int right = n - 1;
                while(left < right)
                {
                    if(nums[i] + nums[j] + nums[left] + nums[right] < target)
                    {
                        left++;
                    }
                    else if(nums[i] + nums[j] + nums[left] + nums[right] > target)
                    {
                        right--;
                    }
                    else{
                        res.push_back(vector<int>{nums[i], nums[j], nums[left], nums[right]});
                        do{
                            left++;
                        }while(left < right && nums[left] == nums[left-1]);
                        do{
                            right--;
                        }while(left < right && nums[right] == nums[right + 1]);
                    }
                }