//url:https://leetcode.com/problems/leaf-similar-trees/description/
/**
* 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:
bool leafSimilar(TreeNode* root1, TreeNode* root2) {
vector v1,v2;
getLeafVec(root1,v1);
getLeafVec(root2,v2);
int v1size=v1.size();
int v2size=v2.size();
if(v1size!=v2size)
return false;
for(int i=0;i& vec){
if(!root)
{
return;
}
if(!root->left&&!root->right){
vec.push_back(root->val);
}
getLeafVec(root->left,vec);
getLeafVec(root->right,vec);
}
};
- 本文作者: royalchen
- 本文链接: http://www.royalchen.com/2018/07/23/leetcode-872-leaf-similar-trees/
- 版权声明: 本博客所有文章除特别声明外,均采用 MIT 许可协议。转载请注明出处!