LC: 339. Nested List Weight Sum

https://leetcode.com/problems/nested-list-weight-sum/

Details:

Der Durchlauf der Liste kann durch Tiefensuche erreicht werden, was auch mit der Multiplikationen hilfreich ist. Man kann auch BFS verwenden, aber dafür braucht man andere Datenstrukturen, um die Tiefe der Blätter zu speichern.

Solutions:

algorithms/src/main/java/algorithms/curated170/medium/NestedListWeightSum.java at master · spiralgo/algorithmsGitHub

Default Code:

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * public interface NestedInteger {
 *     // Constructor initializes an empty nested list.
 *     public NestedInteger();
 *
 *     // Constructor initializes a single integer.
 *     public NestedInteger(int value);
 *
 *     // @return true if this NestedInteger holds a single integer, rather than a nested list.
 *     public boolean isInteger();
 *
 *     // @return the single integer that this NestedInteger holds, if it holds a single integer
 *     // Return null if this NestedInteger holds a nested list
 *     public Integer getInteger();
 *
 *     // Set this NestedInteger to hold a single integer.
 *     public void setInteger(int value);
 *
 *     // Set this NestedInteger to hold a nested list and adds a nested integer to it.
 *     public void add(NestedInteger ni);
 *
 *     // @return the nested list that this NestedInteger holds, if it holds a nested list
 *     // Return empty list if this NestedInteger holds a single integer
 *     public List<NestedInteger> getList();
 * }
 */
class Solution {
    public int depthSum(List<NestedInteger> nestedList) {
        
    }
}

PreviousLC: 323. Number of Connected Components in an Undirected Graph NextLC: 346. Moving Average from Data Stream

Last updated 3 years ago