-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path25-reverseKGroup.h
More file actions
65 lines (48 loc) · 1.17 KB
/
25-reverseKGroup.h
File metadata and controls
65 lines (48 loc) · 1.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#pragma once
#include "ListNode.h"
/*给你一个链表，每 k 个节点一组进行翻转，请你返回翻转后的链表。
k 是一个正整数，它的值小于或等于链表的长度。
如果节点总数不是 k 的整数倍，那么请将最后剩余的节点保持原有顺序。
*/
class C25ReverseKGroup
{
public:
C25ReverseKGroup();
~C25ReverseKGroup();
public:
ListNode* reverseKGroup(ListNode* head, int k);
ListNode* reverse(ListNode* pre, ListNode* head, int k,ListNode*& next);
private:
};
C25ReverseKGroup::C25ReverseKGroup()
{
}
C25ReverseKGroup::~C25ReverseKGroup()
{
}
ListNode* C25ReverseKGroup::reverseKGroup(ListNode* head, int k)
{
if (k <= 1 || head == nullptr)
return head;
ListNode* pre = nullptr;
ListNode* pHeader = head;
ListNode* next = nullptr;
}
ListNode* C25ReverseKGroup::reverse(ListNode* pre, ListNode* head, int k, ListNode*& next)
{
ListNode* pTmp = head;
int nCount = k;
while (nCount-- && pTmp)
pTmp = pTmp->next;
if (pTmp == nullptr || nCount > 0)
return head;
ListNode* pHead = head;
while (pHead && k--)
{
next = pHead->next;
pHead->next = pre;
pre = pHead;
pHead = next;
}
return next;
}