1、想法,记录遍历中的最大值,走到底要pop出来
/**
* 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:
int maxpath=0;
vector<TreeNode*> vect;
int maxDepth(TreeNode* root) {
if(!root)
return maxpath;
vect.push_back(root);
if(root->left)
maxDepth(root->left);
if(root->right)
maxDepth(root->right);
maxpath=maxpath>vect.size() ? maxpath:vect.size();
vect.pop_back();
return maxpath;
}
};