＜leetcode＞1302.层数最深叶子节点的和——二叉树、深度搜索

给你一棵二叉树的根节点 root ，请你返回 层数最深的叶子节点的和 。

来源：leetcode

解答：使用容器与深度优先搜索算法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int deepestLeavesSum(TreeNode* root) {
        vector<int> count;
        count.push_back(0);
        dfs(root, count, 0); 
        return count.back();      
    }

    void dfs(TreeNode* root, vector<int> & count, int i){
        if(!root) return;
        if( i >= size(count)){
           count.push_back(0); 
        }
        count[i] += root->val;
        dfs(root->left, count, i+1);
        dfs(root->right, count, i+1);
    }
};