Published on 2022-03-15
class Solution {public: int dfs(TreeNode* root,int u){ if(!root)return 0; u=u*10+root->val; if(!root->left&&!roo
Published on 2022-03-14
Published on 2022-03-13
class Solution {public: void handle(Node* &last,Node* &p,Node* &nextStart){ if(last){ last->next=p; }
Published on 2022-03-12
Published on 2022-03-11
Published on 2022-03-11
Published on 2022-03-07
Published on 2022-03-07
Published on 2022-03-06
Published on 2022-03-06
-ca9fe781c2d244deaabd5ebe8c1c61a1.JPG)
