Package g1701_1800.s1791_find_center_of_star_graph

Class Solution

java.lang.Object

g1701_1800.s1791_find_center_of_star_graph.Solution

public class Solution
extends Object

1791 - Find Center of Star Graph.<p>Easy</p> <p>There is an undirected <strong>star</strong> graph consisting of <code>n</code> nodes labeled from <code>1</code> to <code>n</code>. A star graph is a graph where there is one <strong>center</strong> node and <strong>exactly</strong> <code>n - 1</code> edges that connect the center node with every other node.</p> <p>You are given a 2D integer array <code>edges</code> where each <code>edges[i] = [u_i, v_i]</code> indicates that there is an edge between the nodes <code>u_i</code> and <code>v_i</code>. Return the center of the given star graph.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/24/star_graph.png" alt="" /></p> <p><strong>Input:</strong> edges = [[1,2],[2,3],[4,2]]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> As shown in the figure above, node 2 is connected to every other node, so 2 is the center.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> edges = [[1,2],[5,1],[1,3],[1,4]]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>3 <= n <= 10⁵</code></li> <li><code>edges.length == n - 1</code></li> <li><code>edges[i].length == 2</code></li> <li><code>1 <= u_i, v_i <= n</code></li> <li><code>u_i != v_i</code></li> <li>The given <code>edges</code> represent a valid star graph.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	findCenter(int[][] edges)

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

findCenter

public int findCenter(int[][] edges)