Leetcode7.7嵌套列表权重和

注意区分NestedInteger 和vector<NestedInteger>两种数据类型

/**
 * // This is the interface that allows for creating nested lists.
 * // You should not implement it, or speculate about its implementation
 * class NestedInteger {
 *   public:
 *     // Constructor initializes an empty nested list.
 *     NestedInteger();
 *
 *     // Constructor initializes a single integer.
 *     NestedInteger(int value);
 *
 *     // Return true if this NestedInteger holds a single integer, rather than a nested list.
 *     bool isInteger() const;
 *
 *     // Return the single integer that this NestedInteger holds, if it holds a single integer
 *     // The result is undefined if this NestedInteger holds a nested list
 *     int getInteger() const;
 *
 *     // Set this NestedInteger to hold a single integer.
 *     void setInteger(int value);
 *
 *     // Set this NestedInteger to hold a nested list and adds a nested integer to it.
 *     void add(const NestedInteger &ni);
 *
 *     // Return the nested list that this NestedInteger holds, if it holds a nested list
 *     // The result is undefined if this NestedInteger holds a single integer
 *     const vector<NestedInteger> &getList() const;
 * };
 */
class Solution {
public:
    int solve(int depth, vector<NestedInteger>& nestedList){
       
            int sum = 0;
            for(int i = 0 ; i < nestedList.size(); i++){
                if(nestedList[i].isInteger()) sum = sum + depth*nestedList[i].getInteger();
                else sum = sum + solve(depth+1,nestedList[i].getList());
            }
            return sum;
    }
    int depthSum(vector<NestedInteger>& nestedList) {
        return solve(1,nestedList);
    }
};