/**
* 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:
vector<string>ans;
void preorder(TreeNode* root,string cnt){
cnt+=to_string(root->val);
if(root->left==NULL&&root->right==NULL){
ans.push_back(cnt);
return;
}
if(root->left){
preorder(root->left,cnt+"->");
}
if(root->right){
preorder(root->right,cnt+"->");
}
}
vector<string> binaryTreePaths(TreeNode* root) {
if(root==NULL)return ans;
string cnt;
preorder(root,cnt);
return ans;
}
};
257. 二叉树的所有路径
最新推荐文章于 2024-08-09 20:36:57 发布