Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- node* reverse_K_nodes(node* head, int k){
- node* current = head;
- node* next = NULL;
- node* prev = NULL;
- while(current != NULL && k--){
- next = current->getNextNode();
- current->updateLink(prev);
- prev = current;
- current = next;
- }
- head = prev;
- current = head;
- while(current->getNextNode() != NULL){
- current = current->getNextNode();
- }
- current->updateLink(next);
- return head;
- }
Add Comment
Please, Sign In to add comment