算法精粹(algorithm-essentials)

感谢soulmachine@github提供内容
## Reverse Linked List II


### 描述

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

For example:
Given `1->2->3->4->5->nullptr`, `m` = 2 and `n` = 4,

return `1->4->3->2->5->nullptr`.

Note:
Given `m`, `n` satisfy the following condition:
$$1 \leq m \leq n \leq $$ length of list.


### 分析

这题非常繁琐,有很多边界检查,15分钟内做到bug free很有难度!


### 代码

{% codesnippet "./code/reverse-linked-list-ii."+book.suffix, language=book.suffix %}{% endcodesnippet %}