LC872:叶子相似的树
定义相似:叶节点序列相同
/**
* 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:
void dfs(TreeNode* root, vector<int>& se)
{
if(root->left == nullptr && root->right == nullptr)
{
se.push_back(root->val);
return;
}
if(root->left != nullptr)
dfs(root->left, se);
if(root->right != nullptr)
dfs(root->right, se);
}
bool leafSimilar(TreeNode* root1, TreeNode* root2) {
vector<int> se1, se2;
dfs(root1, se1);
dfs(root2, se2);
int n1 = se1.size(), n2 = se2.size(), i = 0;
if(n1 != n2) return false;
for(int i = 0; i < n1; i++)
{
if(se1[i] != se2[i])
return false;
}
return true;
}
};