题目描述的不清晰啊,理解了好久
假设节点
node
\textit{node}
node 为根的子树中所有的叶子节点均为「不足节点」,则可以推断出
node
\textit{node}
node 一定也为「不足节点」,即经过该节点所有“根-叶” 路径的总和都小于
limit
\textit{limit}
limit,此时该节点需要删除;
若存在和>limit,则不是不足节点,无需删除
自底向上的做dfs即可\
AC 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:
bool isSuffiicientSubset(TreeNode* node,int sum, int limit){
if(!node) return false;
if(node->left==nullptr&&node->right==nullptr) return node->val+sum>=limit;
bool haveSufficientLeft = isSuffiicientSubset(node->left,sum+node->val,limit);
bool haveSufficientRight = isSuffiicientSubset(node->right,sum+node->val,limit);
if(!haveSufficientLeft) node->left = nullptr;
if(!haveSufficientRight) node->right=nullptr;
return haveSufficientLeft||haveSufficientRight;
}
TreeNode* sufficientSubset(TreeNode* root, int limit) {
bool cx = isSuffiicientSubset(root, 0, limit);
return cx ? root : nullptr;
}
};