LC206 -> LC92 -> LC25 由易到难,反转链表迭代法梳理
姊妹篇——递归法解决反转链表问题:
LC206(从头到尾反转整个链表)
class Solution {
public ListNode reverseList(ListNode head) {
// 定义prev和next结点来记录cur前后结点,cur代表当前结点,即头结点head
ListNode prev = null;
ListNode curr = head;
while(curr != null){// 如果cur的下一个结点不为空
ListNode next = curr.next;
// 进行翻转
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}
}
// curr是前后指针都进行转向的结点
// prev是记录前结点,next是记录后结点
LC92(反转指定左右指针间的链表)
class Solution {
public ListNode reverseBetween(ListNode head, int left, int right) {
ListNode dummyNode = new ListNode(-1);
dummyNode.next = head;
ListNode prec = dummyNode;
for(int i = 0; i < left - 1; i ++){
prec = prec.next;
}
ListNode rightNode = prec;
for(int i = 0; i < right - left + 1; i ++){
rightNode = rightNode.next;
}
ListNode leftNode = prec.next;
ListNode succ = rightNode.next;
prec.next = null;
rightNode.next = null;
reverse(leftNode);
prec.next = rightNode;
leftNode.next = succ;
return dummyNode.next;
}
//prec前结点 succ后结点
//curr前后指针反向的结点
//leftNode反转链表左结点 rightNode反转链表右结点
//prev前结点 next后结点
public void reverse(ListNode head){
ListNode prev = null;
ListNode curr = head;
while(curr != null){
ListNode next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
}
}
LC25(链表每k个节点进行一次反转)
class Solution {
public ListNode reverseKGroup(ListNode head, int k) {
ListNode dummy = new ListNode(-1);
dummy.next = head;
ListNode prec = dummy;
ListNode rightNode = dummy; //初始化rightNode
while (rightNode.next != null) {
for (int i = 0; i < k && rightNode != null; i++)
rightNode = rightNode.next;
if (rightNode == null)
break;
ListNode leftNode = prec.next;
ListNode succ = rightNode.next;
rightNode.next = null;
prec.next = reverse(leftNode);
leftNode.next = succ;
prec = leftNode;
rightNode = prec;
}
return dummy.next;
}
//prec前结点 succ后结点
//curr前后指针反向的结点
//leftNode反转链表左结点 rightNode反转链表右结点
//prev前结点 next后结点
public ListNode reverse(ListNode head){
ListNode prev = null;
ListNode curr = head;
while(curr != null){
ListNode next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}
}