Leetcode 92. Reverse Linked List II | | Leetcode 92. Reverse Linked List II 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950/** * 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 m, int n) { if(m == n) { return head; } ListNode* start = nullptr; ListNode* end = nullptr; ListNode* left = nullptr; ListNode* right = nullptr; ListNode* pre = nullptr; ListNode* current = head; ListNode* next = nullptr; int diff = n - m + 1; m--; while(m) { pre = current; current = current->next; m--; } start = pre; right = current; while(diff) { next = current->next; current->next = pre; pre = current; current = next; diff--; } left = pre; end = current; right->next = end; if(start) { start->next = left; return head; } else { return left; } }}; Reference https://leetcode.com/problems/reverse-linked-list-ii/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏