lc每日一题

11.盛水最多的容器(2022.2.14)15. 三数之和(2022.2.15)

class Solution {
public:
    int maxArea(vector& height) {
        //双指针贪心
        int i = 0;
        int j = height.size()-1;
        int res = 0;
        while(i!=j){
            int temp = (j-i)*min(height[i],height[j]);
            if(temp>=res) res = temp;
            if(height[i]<=height[j]){
                i++;
            }else{
                j--;
            }
        }
        return res;
    }
};

class Solution {
public:
    vector> threeSum(vector& nums) {
        vector> res;
        if(nums.size()<3) return res;//特殊情况 
        
        sort(nums.begin(),nums.end()); //“排序+跳过”来去重
        for(int i=0;i0) return res;
            if(i>0&&nums[i]==nums[i-1]) continue; //重复元素跳过
            int j = i+1;
            int k = nums.size()-1;            
            while(j0){
                    k--;
                }else j++;
            }
        }
        return res;
    }
};