leetcode 99. 恢复二叉搜索树

“无脑”思路

说是“无脑”，其实我看了一眼标准答案的标题：中序遍历，才反应过来，对二叉搜索树进行中序遍历能得到升序排列的数列是一个很重要的性质啊！

“无脑”代码

Talk is cheap, show me the code.

/**
 * 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<int> wrong_pos;
    bool flag = true;
    int index = 0;
    void recoverTree(TreeNode* root) {
        dfs(root);
        sort(wrong_pos.begin(), wrong_pos.end());
        flag = false;
        dfs(root);
    }

    void dfs(TreeNode* root){
        if(!root)
            return;
        dfs(root->left);
        if(flag)
            wrong_pos.push_back(root->val);
        else {
            root->val = wrong_pos[index++];
        }
        dfs(root->right);
    }
};