import java.util.*; public class Solution { public ListNode reverseBetween (ListNode head, int m, int n) { //加个表头 fast-template ListNode res = new ListNode(-1); res.next = head; //前序节点 ListNode pre = res; //当前节点 ListNode cur = head; //找到m for (int i = 1; i < m; i++) { pre = cur; cur = cur.next; }...