Package g2001_2100.s2076_process_restricted_friend_requests

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2076 - Process Restricted Friend Requests\.

    Hard

    You are given an integer n indicating the number of people in a network. Each person is labeled from 0 to n - 1.

    You are also given a 0-indexed 2D integer array restrictions, where <code>restrictionsi = x<sub>i</sub>, y<sub>i</sub></code> means that person <code>x<sub>i</sub></code> and person <code>y<sub>i</sub></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 requests, where <code>requestsj = u<sub>j</sub>, v<sub>j</sub></code> is a friend request between person <code>u<sub>j</sub></code> and person <code>v<sub>j</sub></code>.

    A friend request is successful if <code>u<sub>j</sub></code> and <code>v<sub>j</sub></code> can be friends. Each friend request is processed in the given order (i.e., requests[j] occurs before requests[j + 1]), and upon a successful request, <code>u<sub>j</sub></code> and <code>v<sub>j</sub></code> become direct friends for all future friend requests.

    Return a boolean array result, where each result[j] is true if the <code>j<sup>th</sup></code> friend request is successful or false if it is not.

    Note: If <code>u<sub>j</sub></code> and <code>v<sub>j</sub></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:

    • 2 &lt;= n &lt;= 1000

    • 0 &lt;= restrictions.length &lt;= 1000

    • restrictions[i].length == 2

    • <code>0 <= x<sub>i</sub>, y<sub>i</sub><= n - 1</code>

    • <code>x<sub>i</sub> != y<sub>i</sub></code>

    • 1 &lt;= requests.length &lt;= 1000

    • requests[j].length == 2

    • <code>0 <= u<sub>j</sub>, v<sub>j</sub><= n - 1</code>

    • <code>u<sub>j</sub> != v<sub>j</sub></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final BooleanArray friendRequests(Integer n, Array<IntArray> restrictions, Array<IntArray> requests)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait