leetcode::process_restricted_friend_requests::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< bool >	friendRequests (int n, vector< vector< int > > &restrictions, vector< vector< int > > &requests)

详细描述

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

成员函数说明

friendRequests()

vector< bool > leetcode::process_restricted_friend_requests::Solution::friendRequests ( int n, vector< vector< int > > & restrictions, vector< vector< int > > & requests )

static

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

                                                                                                                     {
            UnionFind uf(n);
            vector<bool> ans(requests.size());
            auto check = [&uf, &restrictions](int x, int y) -> bool {
                x = uf.find(x);
                y = uf.find(y);
                if(x > y) {
                    swap(x, y);
                }
                for(auto &restriction: restrictions) {
                    int i = uf.find(restriction[0]);
                    int j = uf.find(restriction[1]);
                    if(i > j) {
                        swap(i, j);
                    }
                    if(i == x && j == y) {
                        return false;
                    }
                }
                return true;
            };
            for(int i = 0; i < requests.size(); i++) {
                if(check(requests[i][0], requests[i][1])) {
                    uf.unite(requests[i][0], requests[i][1]);
                    ans[i] = true;
                } else {
                    ans[i] = false;
                }
            }
            return ans;
        }

引用了 UnionFind::find() , 以及 UnionFind::unite().

被这些函数引用 leetcode::process_restricted_friend_requests::TEST() , 以及 leetcode::process_restricted_friend_requests::TEST().

---

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

• leetcode.h
• leetcode.cpp