首页 > 代码库 > [leetcode] Reverse Linked List II
[leetcode] Reverse Linked List II
题目：（LinkedList）
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->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
题解：
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public ListNode reverseBetween(ListNode head, int m, int n) { ListNode fakeHead = new ListNode(0); fakeHead.next = head ; if(head==null||head.next==null) return fakeHead.next; ListNode prev = fakeHead; ListNode curr = null; ListNode last = null; for(int i=0; i<n; i++) { if(i<m-1) { prev=prev.next; } else if(i==m-1) { last=prev.next; curr=last.next; } else { last.next=curr.next; curr.next=prev.next; prev.next=curr; curr=last.next; } } return fakeHead.next; }}
[leetcode] Reverse Linked List II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。