力扣第 310 场周赛

最新推荐文章于 2022-10-14 09:42:31 发布

leimingzeOuO

最新推荐文章于 2022-10-14 09:42:31 发布

阅读量94

点赞数

分类专栏：算法 LeetCode 数据结构文章标签： leetcode 算法 c++ 贪心算法数据结构

本文链接：https://blog.csdn.net/qq_52765554/article/details/126811624

版权

算法同时被 3 个专栏收录

115 篇文章 3 订阅

订阅专栏

LeetCode

35 篇文章 3 订阅

订阅专栏

数据结构

35 篇文章 4 订阅

订阅专栏

6176. 出现最频繁的偶数元素

#define x first
#define y second
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define dwn(i,n,x) for(int i=n;i>=x;i--)
#define ll_INF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
class Solution {
public:
    int mostFrequentEven(vector<int>& nums) {
        map<int,int>mp;
        for(auto x:nums)
            if(x%2==0)mp[x]++;
        if(mp.size()==0)return -1;
        int maxv=0;
        int res=0;
        for(auto x:mp)
            if(maxv<x.y)maxv=x.y,res=x.x;
        return res;
    }
};

6177. 子字符串的最优划分

class Solution {
public:
    int partitionString(string s) {
        map<char,int>mp;
        int res=1;
        for(int i=0,j=0;i<s.size();i++)
        {
            if(mp[s[i]])
            {
                mp[s[i]]++;
                while(j<i)mp[s[j]]--,j++;
                res++;
            }
            else mp[s[i]]++;
        }
        return res;
    }
};

6178. 将区间分为最少组数

#define x first
#define y second
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define dwn(i,n,x) for(int i=n;i>=x;i--)
#define ll_INF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
class Solution {
public:
    static bool cmp(vector<int>a,vector<int>b)
    {
        if(a[0]!=b[0])return a[0]<b[0];
        else return a[1]<b[1];
    }
    int minGroups(vector<vector<int>>& intervals) {
        sort(intervals.begin(),intervals.end());
        priority_queue<int,vector<int>,greater<int>>heap;
        for(auto x:intervals)
        {
            if(heap.size()&&heap.top()<x[0])heap.pop();
            heap.push(x[1]);
        }
        return heap.size();
    }
};

6178. 将区间分为最少组数

#define x first
#define y second
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define dwn(i,n,x) for(int i=n;i>=x;i--)
#define ll_INF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
class Solution {
public:
    static bool cmp(vector<int>a,vector<int>b)
    {
        if(a[0]!=b[0])return a[0]<b[0];
        else return a[1]<b[1];
    }
    int minGroups(vector<vector<int>>& intervals) {
        sort(intervals.begin(),intervals.end());
        priority_queue<int,vector<int>,greater<int>>heap;
        for(auto x:intervals)
        {
            if(heap.size()&&heap.top()<x[0])heap.pop();
            heap.push(x[1]);
        }
        return heap.size();
    }
};