zoukankan      html  css  js  c++  java
  • 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:
    Given the list [[1,1],2,[1,1]], return 8. (four 1's at depth 1, one 2 at depth 2)

    Example 2:
    Given the list [1,[4,[6]]], return 17. (one 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17)

    public int DepthSumInverse(IList<NestedInteger> nestedList) {
            var outputs = new List<int>();
            outputs.Add(0);
            outputs.Add(-1);
            var a = Depth(nestedList,-1,outputs);
            return (outputs[1]*(-1)+1)* outputs[0] + a;
        }
        
        public int Depth(IList<NestedInteger> nestedList, int depth,List<int> outputs)
        {
            int res =0;
            if(nestedList.Count()==0) return 0;
            else
            {
                foreach(var n in nestedList)
                {
                    if(n.IsInteger())
                    {
                        res += n.GetInteger()*depth;
                        outputs[0] +=  n.GetInteger();
                    }
                    else
                    {
                        outputs[1] = Math.Min(outputs[1],depth-1);
                        res += Depth(n.GetList(),depth-1,outputs);
                    }
                }
                return res;
            }
        }

    Or BFS

    public int DepthSumInverse(IList<NestedInteger> nestedList) {
            if(nestedList.Count()==0) return 0;
            int unWeight =0;
            int weight = 0;
            var queue = new Queue<IList<NestedInteger>>();
            queue.Enqueue(nestedList);
            while(queue.Count()>0)
            {
                int size = queue.Count();
                for(int i =0;i< size;i++)
                {
                     var nest = queue.Dequeue();
                     foreach(var n in nest )
                    {
                    if(n.IsInteger()) unWeight += n.GetInteger();
                    else queue.Enqueue(n.GetList());
                    }   
                }
                weight += unWeight;
            }
            return weight;
        }
  • 相关阅读:
    2020.12.15
    2020.12.14
    2020.12.13
    2020.12.11
    2020.12.10
    语音合成标记语言(SSML)
    Skyline查询
    win10 VMware 安装 Linux 虚拟机
    图像梯度计算
    Harris Corner Detection
  • 原文地址:https://www.cnblogs.com/renyualbert/p/5902328.html
Copyright © 2011-2022 走看看