Package g0601_0700.s0684_redundant_connection

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    684 - Redundant Connection.

    Medium

    In this problem, a tree is an undirected graph that is connected and has no cycles.

    You are given a graph that started as a tree with n nodes labeled from 1 to n, with one additional edge added. The added edge has two different vertices chosen from 1 to n, and was not an edge that already existed. The graph is represented as an array edges of length n where <code>edgesi = a<sub>i</sub>, b<sub>i</sub></code> indicates that there is an edge between nodes <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code> in the graph.

    Return an edge that can be removed so that the resulting graph is a tree of n nodes. If there are multiple answers, return the answer that occurs last in the input.

    Example 1:

    Input: edges = \[\[1,2],1,3,2,3]

    Output: 2,3

    Example 2:

    Input: edges = \[\[1,2],2,3,3,4,1,4,1,5]

    Output: 1,4

    Constraints:

    • n == edges.length

    • 3 &lt;= n &lt;= 1000

    • edges[i].length == 2

    • <code>1 <= a<sub>i</sub>< b<sub>i</sub><= edges.length</code>

    • <code>a<sub>i</sub> != b<sub>i</sub></code>

    • There are no repeated edges.

    • The given graph is connected.

    • 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 IntArray findRedundantConnection(Array<IntArray> edges)

      • Methods inherited from class java.lang.Object

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