题解 | #链表中的节点每k个一组翻转#
链表中的节点每k个一组翻转
https://www.nowcoder.com/practice/b49c3dc907814e9bbfa8437c251b028e
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
class Solution {
public:
/**
*
* @param head ListNode类
* @param k int整型
* @return ListNode类
*/
ListNode* reverseKGroup(ListNode* head, int k) {
// write code here
ListNode* tail = head;
for(int i = 0;i<k;i++)
{
if(tail == NULL)
{
return head;
}
tail = tail->next;
}
ListNode* pre = NULL;
ListNode* cur = head;
while(cur!=tail)
{
ListNode* temp = cur->next;
cur->next = pre;
pre = cur;
cur = temp;
}
head->next = reverseKGroup(tail,k);
return pre;
}
};
需二刷熟悉思路
学而思开奖124人在聊