首页 > 代码库 > [LeetCode] Reverse Nodes in k-Group
[LeetCode] Reverse Nodes in k-Group
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
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *reverseKGroup(ListNode *head, int k) { if (head == NULL || k <= 0) return head; ListNode *pcount = head; ListNode *pter = head; ListNode **prev = &head; ListNode *pnext = NULL; while (pcount != NULL) { int count = 0; for (; count < k && pcount != NULL; ++count) { //判断够不够k pcount = pcount->next; } if (count == k) { ListNode *pnext = NULL; ListNode *pend = pter; ListNode *pstart = pter; while (pter != pcount) { pnext = pter->next; pter->next = pend; pend = pter; pter = pnext; } *prev = pend; prev = &(pstart->next); pstart->next = pter; } } return head; }};
[LeetCode] Reverse Nodes in k-Group
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。