摘要: ```c class Solution { public: vector path1,path2; bool dfs(TreeNode* root,TreeNode* p,vector& path) { if(!root) return false; if(root==p||dfs(root->le 阅读全文
posted @ 2023-06-02 14:39 穿过雾的阴霾 阅读(7) 评论(0) 推荐(0)
摘要: ```c class Solution { public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(p->valval&&q->valval) return lowestCommonA 阅读全文
posted @ 2023-06-02 12:40 穿过雾的阴霾 阅读(8) 评论(0) 推荐(0)