LeetCode_18_四数之和

有空救救我

已于 2022-07-21 15:41:45 修改

阅读量49

点赞数

文章标签： leetcode 算法数据结构

于 2022-07-18 17:51:19 首次发布

本文链接：https://blog.csdn.net/qq_41108978/article/details/125856777

版权

思路跟15. 三数之和一样

class Solution {
public:
    vector<vector<int>> fourSum(vector<int>& nums, int target) {
        vector<vector<int> > result;
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size(); i++) {
            if (i > 0 && nums[i] == nums[i - 1]) continue;
            for (int j = i + 1; j < nums.size(); j++) {
                if (j > i + 1 && nums[j] == nums[j - 1]) continue;
                int left = j + 1;
                int right = nums.size() - 1;
                while (right > left) {
                    //if (nums[i] + nums[j] + nums[left] + nums[right] > target) right--;                    
                    //else if (nums[i] + nums[j] + nums[left] + nums[right] < target) left++;
                    //会溢出
                    if (nums[i] + nums[j] > target - (nums[left] + nums[right])) right--;
                    else if (nums[i] + nums[j] < target - (nums[left] + nums[right])) left++;
                    else{
                        result.push_back(vector<int>{nums[i], nums[j], nums[left], nums[right]});
                        while (right > left && nums[right] == nums[right - 1]) right--;
                        while (right > left && nums[left] == nums[left + 1]) left++;
                        right--;
                        left++;
                    }
                }
            }
        }
        return result;
    }
};