339_nested_list_weight_sum (BFS).js

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * function NestedInteger() {
 *
 *     Return true if this NestedInteger holds a single integer, rather than a nested list.
 *     @return {boolean}
 *     this.isInteger = function() {
 *         ...
 *     };
 *
 *     Return the single integer that this NestedInteger holds, if it holds a single integer
 *     Return null if this NestedInteger holds a nested list
 *     @return {integer}
 *     this.getInteger = function() {
 *         ...
 *     };
 *
 *     Set this NestedInteger to hold a single integer equal to value.
 *     @return {void}
 *     this.setInteger = function(value) {
 *         ...
 *     };
 *
 *     Set this NestedInteger to hold a nested list and adds a nested integer elem to it.
 *     @return {void}
 *     this.add = function(elem) {
 *         ...
 *     };
 *
 *     Return the nested list that this NestedInteger holds, if it holds a nested list
 *     Return null if this NestedInteger holds a single integer
 *     @return {NestedInteger[]}
 *     this.getList = function() {
 *         ...
 *     };
 * };
 */
/**
 * @param {NestedInteger[]} nestedList
 * @return {number}
 */
var depthSum = function(nestedList) {
    let queue = [{list: nestedList, depth: 1}]
    let sum = 0

    while (queue.length > 0) {
        let firstObjInQueue = queue.shift()
        let currentList = firstObjInQueue.list
        let depth = firstObjInQueue.depth

        for(let i=0; i<currentList.length; i++) {
            if (currentList[i].isInteger()) {
                sum += (currentList[i].getInteger()*depth)
            } else {
                queue.push({list: currentList[i].getList(), depth: depth+1})
            }
        }
    }
    return sum
};