半✅\(^o^)/~
给定一个二叉树,找出其最大深度(带路径)。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> res;
vector<int> tmp;
int result=INT_MIN;
int maxDepth(TreeNode* root) {
findpath(root, tmp);
for (int i=0;i<res.size();i++)
{
result= max(result, res[i].size());
}
return result;
}
void findpath(TreeNode* root, vector<int> & tmp)
{
if (root==nullptr)
{
res.push_back(tmp);
return;
}
tmp.push_back(root->val);
findpath(root->left,tmp);
findpath(root->right,tmp);
if (!tmp.empty())
{
tmp.pop_back();
}
}
static int max(int a, int b)
{
return a>b?a:b;
}
};