摘要: # 思路1 ``` class Solution { public: void flatten(TreeNode* root) { while(root) { auto p=root->left; if(p)//找到左儿子的右链 { while(p->right) p=p->right; //将右链 阅读全文
posted @ 2023-05-27 10:30 穿过雾的阴霾 阅读(7) 评论(0) 推荐(0)