Eatswap
/
leetcode-daily
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add: 220416 [cpp]

This commit is contained in:
eat-swap 2022-04-16 17:27:10 +08:00
parent 93216ec220
commit e5549fb0dd
No known key found for this signature in database
GPG Key ID: 8C089CB1A2B7544F
1 changed files with 26 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

52
cpp/2204/220416.cpp
View File

@ -1,26 +1,26 @@
#include <functional> #include <functional>
struct TreeNode { struct TreeNode {
int val; int val;
TreeNode* left; TreeNode* left;
TreeNode* right; TreeNode* right;
explicit TreeNode(int x, TreeNode* left = nullptr, TreeNode* right = nullptr) : val(x), left(left), right(right) {} explicit TreeNode(int x, TreeNode* left = nullptr, TreeNode* right = nullptr) : val(x), left(left), right(right) {}
}; };
class Solution { class Solution {
public: public:
static TreeNode* convertBST(TreeNode* root) { static TreeNode* convertBST(TreeNode* root) {
if (!root) if (!root)
return nullptr; return nullptr;
int x = 0; int x = 0;
std::function<void(TreeNode*)> reversedInOrderTraverse = [&](TreeNode* r) { std::function<void(TreeNode*)> reversedInOrderTraverse = [&](TreeNode* r) {
if (r->right) if (r->right)
reversedInOrderTraverse(r->right); reversedInOrderTraverse(r->right);
r->val = (x += r->val); r->val = (x += r->val);
if (r->left) if (r->left)
reversedInOrderTraverse(r->left); reversedInOrderTraverse(r->left);
}; };
reversedInOrderTraverse(root); reversedInOrderTraverse(root);
return root; return root;
} }
}; };