339. Nested List Weight Sum

Description

Here

Intuition

Pitfall

public int depthSum(List<NestedInteger> nestedList) {
    return depthSum(nestedList, 1);
  }

  private int depthSum(final List<NestedInteger> nestedList, final int depth) {
    int sum = 0;
    for (final NestedInteger i : nestedList) {
      if (i.isInteger()) {
        sum += depth * i.getInteger();
      } else {
        // TODO: 这一行容易乘以 depth
        sum += depthSum(i.getList(), depth + 1);
      }
    }
    return sum;
  }

Solution

results matching ""

    No results matching ""