leetcode No25. Reverse Nodes in k-Group
来源:互联网 发布:柱状图制作软件 编辑:程序博客网 时间:2024/06/17 02:23
Question
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the linked 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
Algorithm
Accepted Code
class Solution {public: ListNode* reverseKGroup(ListNode* head, int k) { if(head==NULL || k<=1) return head; ListNode* cur=head; int i=0; while(cur && i<k){ i++; cur=cur->next; } if(i==k){ cur=reverseKGroup(cur,k); while(i>0){ ListNode* next=head->next; head->next=cur; cur=head; head=next; i--; } head=cur; } return head; }};
阅读全文
0 0
- leetcode No25. Reverse Nodes in k-Group
- 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)
- uci 命令、shell接口、API接口
- HTML 速查列表
- Unity事件系统
- Git的安装及简单配置
- Hold住Leetcode——First Bad Version
- leetcode No25. Reverse Nodes in k-Group
- 单例中自动内存管理
- wordpress配置了腾讯CDN无法登录后台,后台显示:连接已重置
- 矩阵快速幂
- 自动装配,value中有特殊符号,bean的作用域:singleton和Prototype区分
- Java网站链接(URL)生成相应二维码。
- Webrtc delay-base-bwe代码分析(4): OveruseDetector模块
- su 和 sudo 命令的区别
- C#参数数组 params