Package g1701_1800.s1791_find_center_of_star_graph

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1791 - Find Center of Star Graph.

    Easy

    There is an undirected star graph consisting of n nodes labeled from 1 to n. A star graph is a graph where there is one center node and exactly n - 1 edges that connect the center node with every other node.

    You are given a 2D integer array edges where each <code>edgesi = u<sub>i</sub>, v<sub>i</sub></code> indicates that there is an edge between the nodes <code>u<sub>i</sub></code> and <code>v<sub>i</sub></code>. Return the center of the given star graph.

    Example 1:

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

    Output: 2

    Explanation: As shown in the figure above, node 2 is connected to every other node, so 2 is the center.

    Example 2:

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

    Output: 1

    Constraints:

    • <code>3 <= n <= 10<sup>5</sup></code>

    • edges.length == n - 1

    • edges[i].length == 2

    • <code>1 <= u<sub>i,</sub> v<sub>i</sub><= n</code>

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

    • The given edges represent a valid star graph.

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

      • Methods inherited from class java.lang.Object

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