题目:
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.
题目分析:
题目给出一个链表,要求将固定的一段反转,然后接回原链表。
思路:
暂略
注意点:
- 要注意m=1,即头结点也需要反转的时候。
- 厘清各参数表示的位置,不要乱了。
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
import java.util.Stack;
public class Solution {
public ListNode reverseBetween(ListNode head, int m, int n) {
if (head == null){
return null;
}
Stack<ListNode> stack = new Stack<ListNode>();
int i = 1;
ListNode node = head;
ListNode leftEnd = null,rightEnd;
while (i < m){
leftEnd = node;
node = node.next;
i++;
}
while (i <= n){
stack.push(node);
node = node.next;
i++;
}
rightEnd= node;
if (leftEnd != null){
node = stack.pop();
leftEnd.next = node;
}else{
node = stack.pop();
head = node;
}
while (!stack.empty()){
node.next = stack.pop();
node = node.next;
}
node.next = rightEnd;
return head;
}
}