364. Nested List Weight Sum II

Given a nested list of integers, return the sum of all integers in the list weighted by their depth.

Each element is either an integer, or a list -- whose elements may also be integers or other lists.

Different from the previous question where weight is increasing from root to leaf, now the weight is defined from bottom up. i.e., the leaf level integers have weight 1, and the root level integers have the largest weight.

Example 1:

Input: [[1,1],2,[1,1]]
Output: 8 
Explanation: Four 1's at depth 1, one 2 at depth 2.

Example 2:

Input: [1,[4,[6]]]
Output: 17 
Explanation: One 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17.

Rust Solution

struct Solution;
use rustgym_util::*;

impl Solution {
    fn depth_sum_inverse(nested_list: Vec<NestedInteger>) -> i32 {
        use NestedInteger::*;
        let mut weighted = 0;
        let mut unweighted = 0;
        let mut v: Vec<NestedInteger> = nested_list;
        while !v.is_empty() {
            let mut u: Vec<NestedInteger> = vec![];
            for n in v.into_iter() {
                match n {
                    Int(x) => unweighted += x,
                    List(v) => {
                        for x in v.into_iter() {
                            u.push(x);
                        }
                    }
                }
            }
            weighted += unweighted;
            v = u;
        }
        weighted
    }
}

#[test]
fn test() {
    let nested_list = nested_integer!("[[1,1],2,[1,1]]");
    assert_eq!(Solution::depth_sum_inverse(vec![nested_list]), 8);
}

Having problems with this solution? Click here to submit an issue on github.