revrese node in k group
ListNode* reverseKGroup(ListNode* head, int k) {
int count = 0;
ListNode* prevptr= NULL;
ListNode* currptr= head;
ListNode* nextptr;
ListNode *check = head;
while(check) {
count++;
check = check->next;
}
if(count < k) return currptr;
else count = 0;
while(currptr!=NULL && count<k){
nextptr = currptr->next;
currptr->next=prevptr;
prevptr=currptr;
currptr=nextptr;
count ++;
}
if(nextptr!=NULL)
head ->next = reverseKGroup(nextptr, k);
return prevptr;
}
Are there any code examples left?
New code examples in category Other
-
Other 2023-03-27 22:50:10 how to select the whole line in vscode with keyboard shortcut
-
Other 2022-03-27 22:45:24 income of a web developer
-
Other 2022-03-27 22:35:01 \pyrcc_main.py: File does not exist 'resources.qrc'
-
Other 2022-03-27 22:30:45 rick roll embed code
-
Other 2022-03-27 22:20:08 Circuit_04_Potentiometer
-
Other 2022-03-27 22:20:05 iterative power
-
Other 2022-03-27 22:15:11 flutter run all
-
Other 2022-03-27 22:10:05 when is karlson release
-
Other 2022-03-27 22:10:02 wp .htaccess example
-
Other 2022-03-27 22:00:08 bash pause in file read line by line