问题描述
反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。
说明:
1 ≤ m ≤ n ≤ 链表长度。
示例:
输入: 1->2->3->4->5->NULL, m = 2, n = 4
输出: 1->4->3->2->5->NUL
public static ListNode reverse(ListNode head, int m, int n) {
if (head == null || head.next == null) {
return head;
}
ListNode start = null;
ListNode end = null;
ListNode prev = null;
ListNode cur = head;
if (m == n || m > n) {
return head;
}
if (m > 1) {
for (int i = 1; i < m; i++) {
start = cur;
cur = start.next;
end = cur;
}
}
for (int i = m; i <= n; i++) {
ListNode temp = cur.next;
cur.next = prev;
prev = cur;
cur = temp;
}
if (m == 1) {
head.next = cur;
return prev;
}
end.next = cur;
start.next = prev;
return head;
}