From 185ef9fcb0e59f13e9ee0ccb261693cdaddebab0 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: import(solutions): Move leetcode solutions to subdir.

---
 works/solutions/leetcode/cpp/897.cpp | 37 ++++++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 works/solutions/leetcode/cpp/897.cpp

(limited to 'works/solutions/leetcode/cpp/897.cpp')

diff --git a/works/solutions/leetcode/cpp/897.cpp b/works/solutions/leetcode/cpp/897.cpp
new file mode 100644
index 0000000..efc9741
--- /dev/null
+++ b/works/solutions/leetcode/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();
+    }
+};
-- 
cgit v1.2.3