[LeetCode] Reverse Nodes in k-Group每k个一组翻转链表

Rain722

于 2017-12-19 16:50:27 发布

阅读量518

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Rain722/article/details/78844564

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一种算法，该算法将链表中的节点每K个一组进行反转，并返回修改后的链表。讨论了当节点数不是K的倍数时剩余节点的处理方式，并强调了只允许使用常量内存来改变节点指针而非节点值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.

Only constant memory is allowed.

For example,
Given this linked list: 1->2->3->4->5

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

区间的reverse

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
	private static ListNode reverse(ListNode pre, ListNode next)
	{
		ListNode last=pre.next;
		ListNode cur=last.next;
		while(cur!=next)
		{
			last.next=cur.next;
			cur.next=pre.next;
			pre.next=cur;
			cur=last.next;	
		}
		return last;
	}
    public ListNode reverseKGroup(ListNode head, int k) {
		if(head==null||k==1) return head;
		ListNode dummy=new ListNode(-1);
		dummy.next=head;
		ListNode pre=dummy;
		int i=0;
		while(head!=null)
		{
			i++;
			if(i%k==0)
			{
				pre=reverse(pre, head.next);
				head=pre.next;
			}
			else
				head=head.next;
		}
		return dummy.next;
    }
}