Update 92.reverse-linked-list-ii.md

Author: azl397985856

problems/92.reverse-linked-list-ii.md

@@ -118,7 +118,7 @@ class Solution:
 
 ## 代码
 
-语言支持：JS, C++, Python3
+语言支持：JS, Python3
 
 JavaScript Code:
 
@@ -194,55 +194,6 @@ var reverseBetween = function (head, m, n) {
 };
 ```
 
-C++ Code:
-
-```c++
-/**
- * Definition for singly-linked list.
- * struct ListNode {
- *     int val;
- *     ListNode *next;
- *     ListNode(int x) : val(x), next(NULL) {}
- * };
- */
-class Solution {
-public:
-    ListNode* reverseBetween(ListNode* head, int s, int e) {
-        if (s == e) return head;
-        ListNode* prev = nullptr;
-        auto cur = head;
-        for (int i = 1; i < s; ++i) {
-            prev = cur;
-            cur = cur->next;
-        }
-        // 此时各指针指向：
-        // x -> x -> x -> x  -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> x -> x -> x ->
-        // ^head          ^prev ^cur
-        ListNode* p = nullptr;
-        auto c = cur;
-        auto tail = c;
-        ListNode* n = nullptr;
-        for (int i = s; i <= e; ++i) {
-            n = c->next;
-            c->next = p;
-            p = c;
-            c = n;
-        }
-        // 此时各指针指向：
-        // x -> x -> x -> x     8 -> 7 -> 6 -> 5 -> 4 -> 3 -> 2 -> 1     x -> x -> x ->
-        // ^head          ^prev ^p                                 ^cur  ^c
-        //                                                         ^tail
-        if (prev != nullptr) { // 若指向前一个节点的指针不为空，则说明s在链表中间（不是头节点）
-            prev->next = p;
-            cur->next = c;
-            return head;
-        } else {
-            if (tail != nullptr) tail->next = c;
-            return p;
-        }
-    }
-};
-```
 
 Python Code: