551. 嵌套列表的加权和

551. 嵌套列表的加权和

 

给一个嵌套的整数列表, 返回列表中所有整数由它们的深度加权后的总和. 每一个元素可能是一个整数或一个列表(其元素也可能是整数或列表)

样例

例1:

输入: the list [[1,1],2,[1,1]],

输出: 10.

解释:

four 1's at depth 2, one 2 at depth 1, 4 * 1 * 2 + 1 * 2 * 1 = 10

例2:

输入: the list [1,[4,[6]]],

输出: 27.

解释:

one 1 at depth 1, one 4 at depth 2, and one 6 at depth 3; 1 + 4 * 2 + 6 * 3 = 27

 

/**

* // This is the interface that allows for creating nested lists.

* // You should not implement it, or speculate about its implementation

* public interface NestedInteger {

*

*     // @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();

*

*     // @return the nested list that this NestedInteger holds,

*     // if it holds a nested list

*     // Return null if this NestedInteger holds a single integer

*     public List<NestedInteger> getList();

* }

*/

public class Solution {

       public int depthSum(List<NestedInteger> nestedList) {

            // Write your code here

            return sumList(nestedList,1);

        }

        

        private int sumList(List<NestedInteger> nestedList, int p) {

            int sum=0;

            for (int i = 0; i < nestedList.size(); i++) {

                   if (nestedList.get(i).isInteger()){

                       sum=sum+nestedList.get(i).getInteger()*p;

                   }else {

                       sum=sum+sumList(nestedList.get(i).getList(),p+1);

                   }

            }

            return sum;

        }

}