92. Reverse Linked List II

题目链接：https://leetcode.com/problems/reverse-linked-list-ii/

解题思路：

 1 /**
 2  * Definition for singly-linked list.
 3  * public class ListNode {
 4  *     int val;
 5  *     ListNode next;
 6  *     ListNode(int x) { val = x; }
 7  * }
 8  */
 9 class Solution {
10     public ListNode reverseBetween(ListNode head, int m, int n) {
11
12
13         ListNode newhead = new ListNode(-1);
14         newhead.next  = head;
15
16         if(head==null || head.next ==null)
17             return head;
18
19         ListNode startpoint = newhead;
20         ListNode node1 = null;
21         ListNode node2 = null;
22
23         for(int i=0;i<n;i++)
24         {
25             if(i<m-1)
26             {
27                 startpoint = startpoint.next;
28             }
29             else if(i==m-1)
30             {
31                 node1 = startpoint.next;
32                 node2 = node1.next;
33             }
34             else
35             {
36                 node1.next = node2.next;
37                 node2.next = startpoint.next;
38                 startpoint.next = node2;
39                 node2 = node1.next;
40             }
41         }
42         return newhead.next;
43
44     }
45 }

转载于:https://www.cnblogs.com/wangyufeiaichiyu/p/10976836.html

92. Reverse Linked List II相关推荐

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
LeetCode 92. Reverse Linked List II Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4306611.html ...
(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-> ...
let 92. Reverse Linked List II
主题思想: 链表翻转: 链表翻转, 链表翻转经典代码: public ListNode reverseList(ListNode head){if(head==null||head.next==nul ...
92. Reverse Linked List II(反转链表II)
题目链接:https://leetcode.com/problems/reverse-linked-list-ii/ 思路: 先找到需要反转部分的首部,然后依次压栈, 最后出栈,连接即可. AC 2m ...
LeetCode 92. Reverse Linked List II--Python 解法--反转部分链表--笔试算法题
题目地址:Reverse Linked List II - LeetCode Reverse a linked list from position m to n. Do it in one-pass ...
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-> ...

92. Reverse Linked List II

92. Reverse Linked List II相关推荐

最新文章

热门文章