[toc]
# Leetcode 92. 反转链表 II
## 问题描述
[92. 反转链表 II - 力扣（LeetCode）](https://leetcode-cn.com/problems/reverse-linked-list-ii/)
## 算法
### 解法1: 递归
图示
#### 解法1:实现
##### 解法1: python
```
class Solution:
def reverseBetween(self, head: ListNode, m: int, n: int) -> ListNode:
if head is None or head.next is None:
return head
virtualHead = ListNode(0)
virtualHead.next = head
cur = virtualHead
i = 0
