leetcode::the_time_when_the_network_becomes_idle::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	networkBecomesIdle (vector< vector< int > > &edges, vector< int > &patience)

详细描述

在文件 leetcode.h 第 1867 行定义.

成员函数说明

networkBecomesIdle()

int leetcode::the_time_when_the_network_becomes_idle::Solution::networkBecomesIdle ( vector< vector< int > > &  edges, vector< int > &  patience  )

static

在文件 leetcode.cpp 第 4851 行定义.

                                                                                          {
            unordered_map<int, Node *> um;
            unordered_set<int> nodes;
            for(int i = 0; i < patience.size(); i++) {
                um[i] = new Node(i, patience[i]);
                nodes.insert(i);
            }
            for(auto edge: edges) {
                um[edge[0]]->linked.insert(edge[1]);
                um[edge[1]]->linked.insert(edge[0]);
            }
            auto comp = [](const pair<int, int> &s1, const pair<int, int> &s2) -> bool { return s1.second > s2.second; };
            priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(comp)> pq;
            pq.push(make_pair(0, 0));
            while(!nodes.empty()) {
                auto [num, len] = pq.top();
                pq.pop();
                if(nodes.contains(num)) {
                    nodes.erase(num);
                    Node *node = um[num];
                    node->time = len;
                    for(auto next: node->linked) {
                        if(nodes.contains(next)) {
                            pq.push(make_pair(next, len + 1));
                        }
                    }
                }
            }
            int ans = 0;
            for(auto [num, node]: um) {
                if(num != 0) {
                    int resent_num = node->time * 2 / node->patience;
                    if(node->time * 2 % node->patience == 0) {
                        resent_num--;
                    }
                    ans = max(ans, resent_num * node->patience + 2 * node->time + 1);
                }
            }
            return ans;
        }

引用了 leetcode::the_time_when_the_network_becomes_idle::Node::linked , 以及 leetcode::the_time_when_the_network_becomes_idle::Node::time.

被这些函数引用 leetcode::the_time_when_the_network_becomes_idle::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp