Package g0801_0900.s0834_sum_of_distances_in_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    834 - Sum of Distances in Tree.

    Hard

    There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

    You are given the integer n and the array edges where <code>edgesi = a<sub>i</sub>, b<sub>i</sub></code> indicates that there is an edge between nodes <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code> in the tree.

    Return an array answer of length n where answer[i] is the sum of the distances between the <code>i<sup>th</sup></code> node in the tree 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: The tree is shown above.

    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, answer0 = 8, and so on.

    Example 2:

    Input: n = 1, edges = []

    Output: 0

    Example 3:

    Input: n = 2, edges = [1,0]

    Output: 1,1

    Constraints:

    • <code>1 <= n <= 3 * 10<sup>4</sup></code>

    • edges.length == n - 1

    • edges[i].length == 2

    • <code>0 <= a<sub>i</sub>, b<sub>i</sub>< n</code>

    • <code>a<sub>i</sub> != b<sub>i</sub></code>

    • The given input represents a valid tree.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray sumOfDistancesInTree(Integer n, Array<IntArray> edges)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait