solves find center of star graph

Author: anishLearnsToCode

README.md

@@ -436,7 +436,7 @@
 | 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)            |                                                  [![Java](assets/java.png)](src/FindNearestPointThatHasTheSameXOrYCoordinate.java)                                                   |                                                                                                                                   |
 | 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                  [![Java](assets/java.png)](src/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java)                                                   |                                                                                                                                   |
 | 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)                          |                                                     [![Java](assets/java.png)](src/CheckIfOneStringSwapCanMakeStringsEqual.java)                                                     |                                                                                                                                   |
-| 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |
+| 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph)                                                                      |                                                              [![Java](assets/java.png)](src/FindCenterOfStarGraph.java)                                                              |                                                                                                                                   |
 | 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string)                                                        |                                                                                                                                                                                      |                                                                                                                                   |
 | 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum)                                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1805 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string)                                        |                                                                                                                                                                                      |                                                                                                                                   |

src/FindCenterOfStarGraph.java

@@ -0,0 +1,10 @@
+public class FindCenterOfStarGraph {
+    public int findCenter(int[][] edges) {
+        return commonVertex(edges[0], edges[1]);
+    }
+
+    private int commonVertex(int[] e1, int[] e2) {
+        if (e1[0] == e2[0] || e1[0] == e2[1]) return e1[0];
+        return e1[1];
+    }
+}