diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/lowest_common_ancestor.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/lowest_common_ancestor.cpp')
-rw-r--r-- | other/lowest_common_ancestor.cpp | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/other/lowest_common_ancestor.cpp b/other/lowest_common_ancestor.cpp deleted file mode 100644 index ec99f32..0000000 --- a/other/lowest_common_ancestor.cpp +++ /dev/null @@ -1,33 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - TreeNode *lowestCommonAncestor(TreeNode *root, TreeNode *p, TreeNode *q) { - frame ans; - stack<frame> st; - st.push({root, &ans}); - while (st.size()) { - frame *top = &st.top(), *parent = top->parent; - TreeNode *node = top->node; - if (!node || node == p || node == q) { - parent->subs.push_back(node); - st.pop(); - } else if (top->subs.empty()) { - st.push({node->right, top}); - st.push({node->left, top}); - } else { - TreeNode *left = top->subs[0], *right = top->subs[1]; - parent->subs.push_back(!left ? right : !right ? left : node); - st.pop(); - } - } - return ans.subs[0]; - } - -private: - struct frame { - TreeNode *node; - frame *parent; - vector<TreeNode *> subs; - }; -}; |