[LeetCode] Reverse Nodes in k-Group
来源:互联网 发布:c语言switch用法 编辑:程序博客网 时间:2024/06/06 01:34
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
解题思路:
这道题花了我一下午的时间,必须面壁思过~
其实这道题包含了一个小问题,就是单链表的逆转问题,其想法是先扫描的节点放在后面,时间复杂度只需O(n),空间复杂度为O(1)。基于这个思想,我们稍作改动,即为该问题的解。
/** * 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<=1){ return head; } ListNode* myHead=new ListNode(0); myHead->next=head; ListNode* last=myHead; ListNode* pre=myHead; while(true){ int i=0; while(i<k&&last!=NULL){ last=last->next; i++; } if(i<k||last==NULL){ break; } ListNode* partHead=pre->next; pre->next=reverse(partHead, last); pre=last=partHead; } head=myHead->next; delete myHead; return head; } //输入部分链表的头节点,和该部分链表的最后一个节点,返回倒转后该部分链表的头结点 ListNode* reverse(ListNode* head, ListNode* last){ if(head==last){ return head; } ListNode* current=head->next; //原链表的当前节点 ListNode* newHead=head; //新链表的头结点 newHead->next=last->next; while(current!=last){ ListNode* temp=current->next; current->next=newHead; newHead=current; current=temp; } current->next=newHead; newHead=current; return newHead; }};
0 0
- LeetCode:Reverse Nodes in k-Group
- LeetCode: Reverse Nodes in k-Group
- LeetCode : Reverse Nodes in k-Group
- leetcode 42: Reverse Nodes in k-Group
- [Leetcode] reverse nodes in K-Group
- [LeetCode]Reverse Nodes in k-Group
- LeetCode-Reverse Nodes in k-Group
- LeetCode - Reverse Nodes in k-Group
- LeetCode | Reverse Nodes in k-Group
- 【leetcode】Reverse Nodes in k-Group
- Leetcode: Reverse Nodes in k-Group
- leetcode Reverse Nodes in k-Group
- [LeetCode] Reverse Nodes in k-Group
- LeetCode题解: Reverse Nodes in k-Group
- 【Leetcode】Reverse Nodes in k-Group
- LeetCode Reverse Nodes in k-Group
- [Leetcode] Reverse Nodes in k-Group (Java)
- LeetCode(25)Reverse Nodes in K-Group
- hiho 1039 : 字符消除
- JAVA变量及内存分配
- ubuntu建立多级目录命令
- Ubuntu下安装TURN Server (rfc5766-turn-server)
- android手势操作滑动效果触摸屏事件处理
- [LeetCode] Reverse Nodes in k-Group
- java输出当前执行的行号
- 程序数据库管理器不匹配;请检查安装解决
- yuv h264 avi WindowsMediaPlayer播放成功,虽然时间很短
- std::sort函数中的陷阱
- 万恶的console.log()
- MySQL自带函数整理与使用
- apk反编译工具操作汇总
- mysql密码忘记,该怎么办