834. Sum of Distances in Tree c++

最新推荐文章于 2021-11-26 20:15:40 发布

景行cmy

最新推荐文章于 2021-11-26 20:15:40 发布

阅读量168

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/cmy203/article/details/88825206

版权

给定一棵无向、连通的树，节点从1到n编号。第i条边将节点u和v连接在一起。返回一个列表，其中第i个元素是节点i与其他所有节点之间的距离之和。

摘要由CSDN通过智能技术生成

An undirected, connected tree with N nodes labelled 0...N-1 and N-1edges are given.

The ith edge connects nodes edges[i][0] and edges[i][1] together.

Return a list ans, where ans[i] is the sum of the distances between node i and all other nodes.

Example 1:

Input: N = 6, edges = [[0,1],[0,2],[2,3],[2,4],[2,5]]
Output: [8,12,6,10,10,10]
Explanation: 
Here is a diagram of the given tree:
  0
 / \
1   2
   /|\
  3 4 5
We can see that dist(0,1) + dist(0,2) + dist(0,3) + dist(0,4) + dist(0,5)
equals 1 + 1 + 2 + 2 + 2 = 8.  Hence, answer[0] = 8,