Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of list.
Example:
Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL
反转需要三个指针,如此转换然后循环,每次连接结束后then 指向start。next
思路不难理解,只是自己写的时候有点想不起来,需要多看,理解
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseBetween(ListNode head, int m, int n) {
if(head == null)return head;
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode pre = dummy;
for(int i = 0 ; i <m -1;i++){
pre = pre.next;// 移动m -1 次
}
ListNode start = pre.next;
ListNode then = start.next;
for(int i = 0; i< n-m; i++){需要将start后面的n-m个点陆续反转
start.next = then.next; // start 后面指向then 的后面
then.next = pre.next; // then 的后面指向pre的后,相当于then插入pre和 pre。next之间
pre.next = then;
then = start.next;//完成一个元素的反转后,then指向下一个准备被反转(插入pre和pre.next之间)的节点
}
return dummy.next;
}
}```