LC 92反转链表Ⅱ

题目描述：

代码如下：

递归解法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
 ListNode successor=null;//后继结点
  public ListNode reverseN(ListNode head,int n){//反转链表前N个结点
if(n==1){
    successor=head.next;
    return head;
}
ListNode last=reverseN(head.next,n-1);//处理除头结点外后n-1个结点的反转操作
head.next.next=head;
head.next=successor;
return last;
    }

    public ListNode reverseBetween(ListNode head, int left, int right) {
if(left==1){
    //即反转链表前N个结点的操作
  return  reverseN(head,right);
}
head.next=reverseBetween(head.next,left-1,right-1);//转换成上上面left==1这一份基本的操作
return head;
    }
}

迭代解法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseBetween(ListNode head, int left, int right) {//迭代方法
    ListNode walkNode=new ListNode();
    walkNode.next=head;
 ListNode p=walkNode,q=head;
 for(int i=0;i<left-1;i++){
p=p.next;
q=q.next;
 }//将p移动到left的前一个结点，q移动感到left结点
for(int j=left;j<right;j++){//头插法
ListNode removeNode=q.next;//要插入的结点
q.next=removeNode.next;
removeNode.next=p.next;
p.next=removeNode;
}
return walkNode.next;
    }
}