304周赛

最新推荐文章于 2024-05-02 18:32:42 发布

孔XX

最新推荐文章于 2024-05-02 18:32:42 发布

阅读量47

点赞数

分类专栏： leetcode 算法文章标签：算法 leetcode

本文链接：https://blog.csdn.net/qq_39871991/article/details/126085686

版权

leetcode 同时被 2 个专栏收录

3 篇文章 0 订阅

订阅专栏

算法

3 篇文章 0 订阅

订阅专栏

6132. 使数组中所有元素都等于零

class Solution {
public:
    int minimumOperations(vector<int>& nums) {
        int m = 0;
        set<int> s;
        for(auto c:nums){
            s.insert(c);
            m = max(m, c);
        }
        int t= 0 ;
        if((*s.begin())==0) t=1;
        return s.size()-t;
    }
};

6133. 分组的最大数量

class Solution {
public:
    int maximumGroups(vector<int>& g) {
        int n = g.size();
        if(n==1) return 1;
        if(n==2) return 1;
        int ans = 0, t = 0;
        for(int i = 1; 1; ++i){
            t+=i;
            if(t<=n) ans++;
            else break;
        }
        return ans;
    }
};

6134. 找到离给定两个节点最近的节点


class Solution {
public:
    int closestMeetingNode(vector<int>& e, int node1, int node2) {
        int n = e.size();
        vector<bool> b1(n),b2(n);
        vector<int> l1(n,1e9),l2(n,1e9);
        int t = 0;
        b1[node1] = true;l1[node1] = 0; 
        while(node1!=-1&&t<=n){
            l1[node1] = min(t++,l1[node1]);
            b1[node1] = true;
            node1=e[node1];
        }
        t = 0;
        b2[node2] = true;l2[node2] = 0;
        while(node2!=-1&&t<=n){
            l2[node2] = min(t++,l2[node2]);
            b2[node2] = true;
            node2=e[node2];
        }

        cout<<endl;
        int ans = -1,m=-1;
        set<pair<int,int>> res;
        int cha = 1e9;
        bool flag = true;
        for(int i = 0; i < n; ++i){
            if(b1[i]&&b2[i]){
                int t1 = l1[i], t2 = l2[i];
                res.insert({max(t1,t2),i});
                flag = false;
            }
        }
        if(!flag)return res.begin()->second;
        return -1;
    }
};

6135. 图中的最长环

class Solution {
public:
    vector<int> p;
    vector<bool> st;
    vector<int> depth;
    int ans = -1;

    void dfs(int u, int de){
        st[u] = true;
        depth[u] = de;
        int j = p[u];
        if(j!=-1){
            if(!st[j])
                dfs(j,de+1);
            else if(depth[j]){
                ans = max(ans, de+1-depth[j]);
            }
        }
        depth[u] = 0;
    }

    int longestCycle(vector<int>& p) {
        this->p = p;    
        int n = p.size();
        st = vector<bool>(n);
        depth = vector<int>(n);

        for(int i = 0; i < n; ++i){
            if(!st[i])
                dfs(i, 1);
        }
        return ans;
    }
};