feat: add solutions to lc problem: No.1791.Find Center of Star Graph

Author: yanglbme

solution/1700-1799/1791.Find Center of Star Graph/README.md

@@ -40,7 +40,6 @@
 	<li>题目数据给出的 <code>edges</code> 表示一个有效的星型图</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -54,15 +53,23 @@
 ```python
 class Solution:
     def findCenter(self, edges: List[List[int]]) -> int:
-        return edges[0][0] if edges[0][0] == edges[1][0] or edges[0][0] == edges[1][1] else edges[0][1]
+        a, b = edges[0]
+        c, d = edges[1]
+        return a if a == c or a == d else b
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int findCenter(int[][] edges) {
+        int a = edges[0][0], b = edges[0][1];
+        int c = edges[1][0], d = edges[1][1];
+        return a == c || a == d ? a : b;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -77,6 +84,32 @@ function findCenter(edges: number[][]): number {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findCenter(vector<vector<int>>& edges) {
+        int a = edges[0][0], b = edges[0][1];
+        int c = edges[1][0], d = edges[1][1];
+        return a == c || a == d ? a : b;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findCenter(edges [][]int) int {
+	a, b := edges[0][0], edges[0][1]
+	c, d := edges[1][0], edges[1][1]
+	if a == c || a == d {
+		return a
+	}
+	return b
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1791.Find Center of Star Graph/README_EN.md

@@ -6,12 +6,8 @@
 
 <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<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.</p>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Example 1:</strong></p>
@@ -28,12 +24,8 @@
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> edges = [[1,2],[5,1],[1,3],[1,4]]
@@ -42,14 +34,10 @@
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Constraints:</strong></p>
 
-
-
 <ul>
 	<li><code>3 &lt;= n &lt;= 10<sup>5</sup></code></li>
 	<li><code>edges.length == n - 1</code></li>
@@ -68,13 +56,21 @@
 ```python
 class Solution:
     def findCenter(self, edges: List[List[int]]) -> int:
-        return edges[0][0] if edges[0][0] == edges[1][0] or edges[0][0] == edges[1][1] else edges[0][1]
+        a, b = edges[0]
+        c, d = edges[1]
+        return a if a == c or a == d else b
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int findCenter(int[][] edges) {
+        int a = edges[0][0], b = edges[0][1];
+        int c = edges[1][0], d = edges[1][1];
+        return a == c || a == d ? a : b;
+    }
+}
 ```
 
 ### **TypeScript**
@@ -89,6 +85,32 @@ function findCenter(edges: number[][]): number {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findCenter(vector<vector<int>>& edges) {
+        int a = edges[0][0], b = edges[0][1];
+        int c = edges[1][0], d = edges[1][1];
+        return a == c || a == d ? a : b;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findCenter(edges [][]int) int {
+	a, b := edges[0][0], edges[0][1]
+	c, d := edges[1][0], edges[1][1]
+	if a == c || a == d {
+		return a
+	}
+	return b
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1791.Find Center of Star Graph/Solution.go

@@ -0,0 +1,8 @@
+func findCenter(edges [][]int) int {
+	a, b := edges[0][0], edges[0][1]
+	c, d := edges[1][0], edges[1][1]
+	if a == c || a == d {
+		return a
+	}
+	return b
+}

solution/1700-1799/1791.Find Center of Star Graph/Solution.java

@@ -0,0 +1,7 @@
+class Solution {
+    public int findCenter(int[][] edges) {
+        int a = edges[0][0], b = edges[0][1];
+        int c = edges[1][0], d = edges[1][1];
+        return a == c || a == d ? a : b;
+    }
+}

solution/1700-1799/1791.Find Center of Star Graph/Solution.py

@@ -1,3 +1,5 @@
 class Solution:
     def findCenter(self, edges: List[List[int]]) -> int:
-        return edges[0][0] if edges[0][0] == edges[1][0] or edges[0][0] == edges[1][1] else edges[0][1]
+        a, b = edges[0]
+        c, d = edges[1]
+        return a if a == c or a == d else b