LeetCode Reverse Linked List II

链表局部反转问题

代码如下：

class Solution {public ListNode reverseBetween(ListNode head, int m, int n) {if (m == n) return head;ListNode cur = head, pre = null;int cnt = 1;while (cnt < m){if (cnt == m - 1){pre = cur;}cur = cur.next;cnt++;}ListNode p = null;while (cnt <= n){ListNode next = cur.next;cur.next = p;p = cur;cur = next;cnt++;}if (null == pre) {head.next = cur;return p;}else {pre.next.next = cur;pre.next = p;return head;}}
}

LeetCode Reverse Linked List II相关推荐

LeetCode | Reverse Linked List II
这道链表反转题也是搞的我焦头烂额,好久没有写链表了,注意记忆这些 Reverse Linked List II QuestionEditorial Solution My Submissions To ...
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-> ...
[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-> ...
leetcode : Reverse Linked List II [two pointers]
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1-> ...
LeetCode Reverse Linked List II 反置链表2
题意:将指定的一段位置[m,n]的链表反置,返回链表头. 思路:主要麻烦在链表头,如果要从链表头就开始,比较特殊. 目前用DFS实现,先找到m-1的位置,再找到n+1的位置,中间这段就是否要反置的,交 ...
【??链表】LeetCode 92. Reverse Linked List II
LeetCode 92. Reverse Linked List II Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4306611.html ...
LeetCode 92. Reverse Linked List II
92. Reverse Linked List II Reverse a linked list from position m to n. Do it in one-pass. 将位置m的链接列表反 ...
(LeetCode 92)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-> ...
Reverse Linked List II leetcode java
题目: Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1 ...

LeetCode Reverse Linked List II

LeetCode Reverse Linked List II相关推荐

最新文章

热门文章