MyLeetcode/cpp_solutions/1379.cpp at main · Kaminyou/MyLeetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    TreeNode* res;
    void dfs(TreeNode* origin, TreeNode* clone, TreeNode* target) {
        if (origin == nullptr) return;
        if (origin == target) {
            res = clone;
            return;
        }
        if (origin->left) dfs(origin->left, clone->left, target);
        if (origin->right) dfs(origin->right, clone->right, target);
    }
    TreeNode* getTargetCopy(TreeNode* original, TreeNode* cloned, TreeNode* target) {
        dfs(original, cloned, target);
        return res;
    }
};