g2001_2100.s2076_process_restricted_friend_requests.Solution

public class Solution extends Object

2076 - Process Restricted Friend Requests.Hard You are given an integer <code>n</code> indicating the number of people in a network. Each person is labeled from <code>0</code> to <code>n - 1</code>. You are also given a 0-indexed 2D integer array <code>restrictions</code>, where <code>restrictions[i] = [xi, yi]</code> means that person <code>xi</code> and person <code>yi</code> cannot become friends , either directly or indirectly through other people. Initially, no one is friends with each other. You are given a list of friend requests as a 0-indexed 2D integer array <code>requests</code>, where <code>requests[j] = [uj, vj]</code> is a friend request between person <code>uj</code> and person <code>vj</code>. A friend request is successful if <code>uj</code> and <code>vj</code> can be friends. Each friend request is processed in the given order (i.e., <code>requests[j]</code> occurs before <code>requests[j + 1]</code>), and upon a successful request, <code>uj</code> and <code>vj</code> become direct friends for all future friend requests. Return a boolean array <code>result</code>, where each <code>result[j]</code> is <code>true</code> if the <code>jth</code> friend request is successful or <code>false</code> if it is not. Note: If <code>uj</code> and <code>vj</code> are already direct friends, the request is still successful. Example 1: Input: n = 3, restrictions = [[0,1]], requests = [[0,2],[2,1]] Output: [true,false] Explanation: Request 0: Person 0 and person 2 can be friends, so they become direct friends. Request 1: Person 2 and person 1 cannot be friends since person 0 and person 1 would be indirect friends (1–2–0). Example 2: Input: n = 3, restrictions = [[0,1]], requests = [[1,2],[0,2]] Output: [true,false] Explanation: Request 0: Person 1 and person 2 can be friends, so they become direct friends. Request 1: Person 0 and person 2 cannot be friends since person 0 and person 1 would be indirect friends (0–2–1). Example 3: Input: n = 5, restrictions = [[0,1],[1,2],[2,3]], requests = [[0,4],[1,2],[3,1],[3,4]] Output: [true,false,true,false] Explanation: Request 0: Person 0 and person 4 can be friends, so they become direct friends. Request 1: Person 1 and person 2 cannot be friends since they are directly restricted. Request 2: Person 3 and person 1 can be friends, so they become direct friends. Request 3: Person 3 and person 4 cannot be friends since person 0 and person 1 would be indirect friends (0–4–3–1). Constraints: <ul> <li><code>2 <= n <= 1000</code></li> <li><code>0 <= restrictions.length <= 1000</code></li> <li><code>restrictions[i].length == 2</code></li> <li><code>0 <= xi, yi <= n - 1</code></li> <li><code>xi != yi</code></li> <li><code>1 <= requests.length <= 1000</code></li> <li><code>requests[j].length == 2</code></li> <li><code>0 <= uj, vj <= n - 1</code></li> <li><code>uj != vj</code></li> </ul>

Constructor Summary

Constructors

Constructor

Description

Solution()
Method Summary

Modifier and Type

Method

Description

boolean[]

friendRequests(int n, int[][] restrictions, int[][] requests)

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- Solution
  
  public Solution()
Method Details
- friendRequests
  
  public boolean[] friendRequests(int n, int[][] restrictions, int[][] requests)

Class Solution

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Details

Solution

Method Details

friendRequests