_1791. Find Center of Star Graph.md

1791. Find Center of Star Graph

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 27, 2024

Last updated : June 29, 2024

---

Related Topics : Graph

Acceptance Rate : 86.65 %

---

Solutions

• e1791 v1 Daily Inefficient Counter.py
• e1791 v2 oneliner single if.py
• e1791 v2.c
• e1791 v2.cpp
• e1791 v2.java

Python

e1791 v1 Daily Inefficient Counter.py

class Solution:
    def findCenter(self, edges: List[List[int]]) -> int:
        edgeCounter = defaultdict(int)

        for edge in edges :
            edgeCounter[edge[0]] += 1
            edgeCounter[edge[1]] += 1
            
        return max([x for x in edgeCounter], key=lambda x:edgeCounter.get(x))
        

e1791 v2 oneliner single if.py

class Solution:
    def findCenter(self, edges: List[List[int]]) -> int:
        return edges[0][0] if edges[0][0] in edges[1] else edges[0][1]

C

e1791 v2.c

#define findCenter(edges, edgeSize, edgesColSize) ((edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1]) ? edges[0][0] : edges[0][1])

C++

e1791 v2.cpp

class Solution {
public:
    int findCenter(vector<vector<int>>& edges) {
        if (edges[0][0] == edges[1][0] || edges[0][0] == edges[1][1])
            return edges[0][0];
        else
            return edges[0][1];
    }
};

Java

e1791 v2.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];
    }
}