In this guide, you will get 1791. Find Center of Star Graph LeetCode Solution with the best time and space complexity. The solution to Find Center of Star Graph problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
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 edges[i] = [ui, vi] indicates that there is an edge between the nodes ui and vi. 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.
3 <= n <= 105
edges.length == n – 1
edges[i].length == 2
1 <= ui, vi <= n
ui != vi
The given edges represent a valid star graph.
Complexity Analysis
Time Complexity: O(1)
Space Complexity: O(1)
1791. Find Center of Star Graph LeetCode Solution in C++
class Solution {
public:
int findCenter(vector<vector<int>>& edges) {
return edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1]
? edges[0][0]
: edges[0][1];
}
}; /* code provided by PROGIEZ */
1791. Find Center of Star Graph LeetCode Solution in Java
class Solution {
public int findCenter(int[][] edges) {
return edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1] //
? edges[0][0]
: edges[0][1];
}
} // code provided by PROGIEZ
1791. Find Center of Star Graph LeetCode Solution in Python
class Solution:
def findCenter(self, edges: list[list[int]]) -> int:
if edges[0][0] in edges[1]:
return edges[0][0]
return edges[0][1] # code by PROGIEZ
