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≤m≤n≤1 \leq m \leq n \leq length of list.

分析

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

代码

  1. // Reverse Linked List II
  2. // 迭代版，时间复杂度O(n)，空间复杂度O(1)
  3. public class Solution {
  4.     public ListNode reverseBetween(ListNode head, int m, int n) {
  5.         ListNode dummy = new ListNode(-1);
  6.         dummy.next = head;
  8.         ListNode prev = dummy;
  9.         for (int i = 0; i < m-1; ++i)
  10.             prev = prev.next;
  11.         ListNode head2 = prev;
  13.         prev = head2.next;
  14.         ListNode cur = prev.next;
  15.         for (int i = m; i < n; ++i) {
  16.             prev.next = cur.next;
  17.             cur.next = head2.next;
  18.             head2.next = cur;  // 头插法
  19.             cur = prev.next;
  20.         }
  22.         return dummy.next;
  23.     }
  24. };

原文: https://soulmachine.gitbooks.io/algorithm-essentials/content/java/linear-list/linked-list/reverse-linked-list-ii.html