?

ListNode* reverseBetween(ListNode* prev,ListNode* next)//reverse prev->next, last->prev之間的鏈表{ListNode* last = prev->next;ListNode* cur = last->next;while(cur!=next){last->next = cur->next;cur->next = prev->next;prev->next = cur;cur = last->next;}return last;}ListNode *reverseKGroup(ListNode *head, int k) {// Note: The Solution object is instantiated only once and is reused by each test case.if(!head||k<=1) return head;ListNode* dummy = new ListNode(0);dummy->next = head;ListNode* cur = head;ListNode* prev = dummy;int i = 0;while(cur){++i;if(i%k==0){prev = reverseBetween(prev,cur->next); //reverse一個(gè)區(qū)間cur = prev->next; //注意這里不是cur = cur->next;}elsecur = cur->next;}ListNode* newHead = dummy->next;delete dummy;return newHead;}

　　

轉(zhuǎn)載于:https://www.cnblogs.com/summer-zhou/p/3389992.html

總結(jié)

以上是生活随笔為你收集整理的【ATT】Reverse Nodes in k-Group的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。