首页 > 代码库 > 【LeetCode】Reverse Linked List II
【LeetCode】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->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.
public class Solution { public ListNode reverseBetween(ListNode head, int m, int n) { if(m==n||m>n) return head; int len = n-m; ListNode root = head; m--; while(m!=0&&root!=null){ root = root.next; m--; } ListNode cur = root; while(len!=0&&len>0){ ListNode temp = cur; int i=len; while(i!=0){ temp=temp.next; i--; } int tempv = cur.val; cur.val=temp.val; temp.val=tempv; len-=2; cur=cur.next; } return head; } }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。