python3 解法, 执行用时: 112 ms, 内存消耗: 40.3 MB, 提交时间: 2023-10-11 11:06:25

class Solution:
    def findCenter(self, edges: List[List[int]]) -> int:
        x, y = edges[0][0], edges[0][1]
        if x == edges[1][0] or x == edges[1][1]:
            return x
        return y

cpp 解法, 执行用时: 220 ms, 内存消耗: 66.2 MB, 提交时间: 2023-10-11 11:05:41

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

java 解法, 执行用时: 0 ms, 内存消耗: 70.9 MB, 提交时间: 2023-10-11 11:05:29

class Solution {
    public int findCenter(int[][] edges) {
        int x = edges[0][0], y = edges[0][1];
        if ( x == edges[1][0] || x == edges[1][1] )
            return x;
        
        return y;
    }
}

golang 解法, 执行用时: 180 ms, 内存消耗: 13.7 MB, 提交时间: 2021-07-01 15:50:43

func findCenter(edges [][]int) int {
    x, y := edges[0][0], edges[0][1]
    if x == edges[1][0] || x == edges[1][1] {
        return x
    }
    return y
}