summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorcrupest <crupest@outlook.com>2020-07-22 20:06:33 +0800
committerGitHub <noreply@github.com>2020-07-22 20:06:33 +0800
commit98caef5786f80ce39e5a31a74ec4a86c21b866e6 (patch)
tree9f1c45842acc945c71d5b4070b34369e1faf9b61
parent2d6e1587a3c2b689c9a318152f776206d2b51b5f (diff)
downloadsolutions-98caef5786f80ce39e5a31a74ec4a86c21b866e6.tar.gz
solutions-98caef5786f80ce39e5a31a74ec4a86c21b866e6.tar.bz2
solutions-98caef5786f80ce39e5a31a74ec4a86c21b866e6.zip
Add problem 897 .
-rw-r--r--cpp/897.cpp37
1 files changed, 37 insertions, 0 deletions
diff --git a/cpp/897.cpp b/cpp/897.cpp
new file mode 100644
index 0000000..720847b
--- /dev/null
+++ b/cpp/897.cpp
@@ -0,0 +1,37 @@
+/**
+ * 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:
+ std::vector<TreeNode*> result;
+
+ void InOrderTraverse(TreeNode* root) {
+ if (root->left != nullptr)
+ InOrderTraverse(root->left);
+ result.push_back(root);
+ if (root->right != nullptr)
+ InOrderTraverse(root->right);
+ }
+
+ TreeNode* increasingBST(TreeNode* root) {
+ InOrderTraverse(root);
+
+ const auto end = result.end();
+ auto iter1 = result.begin();
+ auto iter2 = result.begin() + 1;
+ for (; iter2 != end; ++iter1, ++iter2) {
+ const auto node = *iter1;
+ node->left = NULL;
+ node->right = *iter2;
+ }
+ (*iter1)->left = (*iter1)->right = NULL;
+
+ return result.front();
+ }
+};