首页 > 代码库 > [LeetCode]92 Reverse Linked List II
[LeetCode]92 Reverse Linked List II
https://oj.leetcode.com/problems/reverse-linked-list-ii/
http://blog.csdn.net/linhuanmars/article/details/24613781
/** * 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) { // Add dummyhead; ListNode dummyhead = new ListNode(0); dummyhead.next = head; // Find the one to reverse ListNode pre = dummyhead; ListNode node = head; for (int i = 1 ; i < m ; i ++) { pre = pre.next; node = node.next; } // Reverse node (n - m) times for (int i = 0 ; i < n - m ; i ++) { ListNode next = node.next; node.next = next.next; // Assuming next won‘t be null since 1 ≤ m ≤ n ≤ length of list. next.next = pre.next; pre.next = next; } head = dummyhead.next; dummyhead.next = null; return head; } }
[LeetCode]92 Reverse Linked List II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。