【leetcode】-92. Reverse Linked List II 反转部分链表II python版

题目

Reverse a linked list from position m to n. Do it in one-pass.

Note: 1 ≤ m ≤ n ≤ length of list.

Example:

Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL

递归法

1、首先递归写出反转全部链表；
2、然后在1基础上反转前n个元素链表；
3、然后在2基础上反转从m到n的链表。

python 代码

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def __init__(self):
        self.remain = None
        
        
    def reverseBetween(self, head: ListNode, m