[LeetCode]114. 二叉树展开为链表 原创

算法标签：链表

题目简叙

代码

/**
 * 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 {
    vector<TreeNode*>tmparr;

    void insert(TreeNode* root){
        if(!root)return ;
        tmparr.push_back(root);
        insert(root->left);
        insert(root->right);
    }
public:
    void flatten(TreeNode* root) {
        insert(root);
        
        int i=0;
        while(i<(int)(tmparr.size()-1)){
            tmparr[i]->left=nullptr;
            tmparr[i]->right=tmparr[i+1];
            i++;
        }
    }
};

AC记录