From dc1f0c4c0096013799416664894c5194dc7e1f52 Mon Sep 17 00:00:00 2001
From: Yuqian Yang <crupest@crupest.life>
Date: Fri, 28 Feb 2025 23:13:39 +0800
Subject: chore(store): move everything to store.

---
 works/solutions/leetcode/cpp/897.cpp | 37 ------------------------------------
 1 file changed, 37 deletions(-)
 delete 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
deleted file mode 100644
index efc9741..0000000
--- a/works/solutions/leetcode/cpp/897.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-/**
- * 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