-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1110.cpp
46 lines (38 loc) · 1.47 KB
/
1110.cpp
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
__________________________________________________________________________________________________
/**
* 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:
vector<TreeNode *> roots;
void dfs(TreeNode *root, bool has_parent, const vector<int> &to_delete) {
if (root == nullptr)
return;
if (find(to_delete.begin(), to_delete.end(), root->val) != to_delete.end()) {
dfs(root->left, false, to_delete);
dfs(root->right, false, to_delete);
return;
}
if (!has_parent)
roots.push_back(root);
dfs(root->left, true, to_delete);
dfs(root->right, true, to_delete);
if (root->left != nullptr && find(to_delete.begin(), to_delete.end(), root->left->val) != to_delete.end())
root->left = nullptr;
if (root->right != nullptr && find(to_delete.begin(), to_delete.end(), root->right->val) != to_delete.end())
root->right = nullptr;
}
vector<TreeNode*> delNodes(TreeNode* root, vector<int>& to_delete) {
roots = {};
dfs(root, false, to_delete);
return roots;
}
};
__________________________________________________________________________________________________
__________________________________________________________________________________________________