Reverse Nodes in k-Group

最新推荐文章于 2022-04-08 22:28:12 发布

原创最新推荐文章于 2022-04-08 22:28:12 发布 · 370 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #c++ #算法 #ListNode

LeetCode 同时被 2 个专栏收录

62 篇文章

订阅专栏

C/C++

60 篇文章

订阅专栏

本文介绍了一种链表操作方法，即每隔K个节点进行一次就地反转的操作，并提供了一个可运行的C++代码实现。该算法适用于链表长度不是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

解题：
链表就地反转的变异版本，每隔K个反转一下，不够K个的不反转，注意处理一下特殊的条件即可。可以AC的C++代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *reverse(ListNode* head){
        if(!head || !head->next){
            return head;
        }
        ListNode *first = head, *second = head->next, *temp;
        while(second){
            temp = second->next;
            second->next = first;
            first = second;
            second = temp;
        }
        head->next = NULL;
        return first;
    }

    ListNode* reverseKG(ListNode* head, int k) {
        int length = 0;
        ListNode *pHead = head, *end;
        while(length < k && pHead){
            end = pHead;
            pHead = pHead->next;
            length ++;
        }
        if(length < k){
            return head;
        }else{
            end->next = NULL;
            ListNode* newHead = reverse(head);
            head->next = reverseKG(pHead, k);
            return newHead;
        } 
    }

    ListNode* reverseKGroup(ListNode* head, int k) {
        if(!head || !head->next){
            return head;
        }
        head = reverseKG(head, k);
        return head;
    }
};