feat: add cpp solution to lc problem: No.0235.Lowest Common Ancestor of a Binary Search Tree

Author: yanglbme

basic/sorting/BubbleSort/README.md

@@ -162,6 +162,8 @@ int main(void)
 }
 ```
 
+<!-- tabs:end -->
+
 ## 算法分析
 
 空间复杂度 O(1)、时间复杂度 O(n²)。

basic/summary.md

@@ -5,6 +5,6 @@
     - [选择排序](/basic/sorting/SelectionSort/README.md)
     - [归并排序](/basic/sorting/MergeSort/README.md)
     - [快速排序](/basic/sorting/QuickSort/README.md)
-    - [堆排序](/basic/sortring/HeapSort/README.md)
+    - [堆排序](/basic/sorting/HeapSort/README.md)
   - 查找算法
     - [二分查找](/basic/searching/BinarySearch/README.md)

index.html

@@ -6,7 +6,7 @@
   <title>LeetCode & Coding Interview Guide</title>
   <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1" />
   <meta name="keywords"
-    content="doc,docs,doocs,documentation,github,coding,pages,leetcode,coding-interview,coding-interview-guide,cracking-the-coding-interview,yanglbme">
+    content="doc,docs,doocs,documentation,github,gitee,coding,pages,leetcode,coding-interview,coding-interview-guide,cracking-the-coding-interview,yanglbme">
   <meta name="description" content="LeetCode、剑指Offer、程序员面试金典题解">
   <meta name="viewport"
     content="width=device-width, user-scalable=no, initial-scale=1.0, maximum-scale=1.0, minimum-scale=1.0">
@@ -80,14 +80,16 @@
               .replace(/\/main/, '/blob/main') : 'https://github.com/doocs/leetcode/blob/main/' + vm.route.file
 
             const github = `[GitHub](${url})`
-            const editHtml = en ? `:memo: Edit on ${github}\n` : `:memo: 在 ${github} 编辑\n`
+            const gitee = `[Gitee](${url.replace("github", "gitee")})`
+            const editHtml = en ? `:memo: Edit on ${github} / ${gitee}\n` : `:memo: 在 ${github} / ${gitee} 编辑\n`
             return editHtml + html
           })
 
           hook.afterEach(function (html) {
             const en = vm.route.file.indexOf('README_EN') != -1
             const copyright = en ? '. All Rights Reserved' : ' 版权所有'
-            const footer = `<footer><span>Copyright © 2018-2021 <a href="https://github.com/doocs" target="_blank">Doocs</a>${copyright}</footer>`
+            const currentYear = new Date().getFullYear()
+            const footer = `<footer><span>Copyright © 2018-${currentYear} <a href="https://github.com/doocs" target="_blank">Doocs</a>${copyright}</footer>`
             return html + footer
           })
         },
@@ -104,8 +106,8 @@
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-java.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-kotlin.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-csharp.min.js"></script>
-  <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-javascript.min.js"></script>
-  <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-typescript.min.js"></script>
+  <script src="//cdn.jsdelivr.net/npm/prismjs@1.15.0/components/prism-javascript.min.js"></script>
+  <script src="//cdn.jsdelivr.net/npm/prismjs@1.15.0/components/prism-typescript.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-python.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-swift.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-nim.min.js"></script>

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/README.md

@@ -258,4 +258,57 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
 }
 ```
 
+### **C++**
+
+迭代：
+
+```cpp
+/**
+ * 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:
+    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        while (root)
+        {
+            if (root->val < p->val && root->val < q->val) root = root->right;
+            else if (root->val > p->val && root->val > q->val) root = root->left;
+            else return root;
+        }
+        return root;
+    }
+};
+```
+
+递归：
+
+```cpp
+/**
+ * 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:
+    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        if (!root) return root;
+        if (root->val < p->val && root->val < q->val) return lowestCommonAncestor(root->right, p, q);
+        if (root->val > p->val && root->val > q->val) return lowestCommonAncestor(root->left, p, q);
+        return root;
+    }
+};
+```
+
 <!-- tabs:end -->

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/README_EN.md

@@ -144,7 +144,7 @@ class Solution {
 
 ### **TypeScript**
 
-迭代：
+Iterative:
 
 ```ts
 /**
@@ -174,7 +174,7 @@ function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: Tree
 };
 ```
 
-递归：
+Recursive:
 
 ```ts
 /**
@@ -252,6 +252,59 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
 }
 ```
 
+### **C++**
+
+Iterative:
+
+```cpp
+/**
+ * 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:
+    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        while (root)
+        {
+            if (root->val < p->val && root->val < q->val) root = root->right;
+            else if (root->val > p->val && root->val > q->val) root = root->left;
+            else return root;
+        }
+        return root;
+    }
+};
+```
+
+Recursive:
+
+```cpp
+/**
+ * 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:
+    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        if (!root) return root;
+        if (root->val < p->val && root->val < q->val) return lowestCommonAncestor(root->right, p, q);
+        if (root->val > p->val && root->val > q->val) return lowestCommonAncestor(root->left, p, q);
+        return root;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0200-0299/0235.Lowest Common Ancestor of a Binary Search Tree/Solution.cpp

@@ -0,0 +1,22 @@
+/**
+ * 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:
+    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        while (root)
+        {
+            if (root->val < p->val && root->val < q->val) root = root->right;
+            else if (root->val > p->val && root->val > q->val) root = root->left;
+            else return root;
+        }
+        return root;
+    }
+};