[leetcode]25. Reverse Nodes in k-Group
来源:互联网 发布:网络信息安全现状 编辑:程序博客网 时间:2024/06/03 19:02
题目链接:https://leetcode.com/problems/reverse-nodes-in-k-group/description/
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
class Solution{public: ListNode* reverse(ListNode* first, ListNode* last) { ListNode* new_head = new ListNode(-1); ListNode*p=first; while ( p != last ) { ListNode*t=p; p=p->next; t->next=new_head->next; new_head->next=t; } return new_head->next; } ListNode* reverseKGroup(ListNode* head, int k) { auto node=head; for (int i=0; i < k; ++i) { if ( ! node ) return head; // nothing to do list too sort node = node->next; } auto new_head = reverse( head, node); head->next = reverseKGroup( node, k); return new_head; }};
阅读全文
0 0
- [LeetCode]25.Reverse Nodes in k-Group
- LeetCode --- 25. Reverse Nodes in k-Group
- LeetCode 25.Reverse Nodes in k-Group
- [Leetcode] 25. Reverse Nodes in k-Group
- 【LeetCode】25.Reverse Nodes in k-Group
- [leetcode] 25.Reverse Nodes in k-Group
- Leetcode-25.Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetCode 25. Reverse Nodes in k-Group
- Leetcode 25. Reverse Nodes in k-Group
- leetcode:25. Reverse Nodes in k-Group
- LeetCode 25. Reverse Nodes in k-Group
- 【leetcode】25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- SpringBoot +maven +idea 最简单的一个web程序的演示流程
- H5解析|如何做“穿上军装”现象级爆款H5,分析完这些你就懂了
- 极角排序
- 数字相关的工具类
- TensorBoard:可视化学习
- [leetcode]25. Reverse Nodes in k-Group
- hdu 1517 A Multiplication Game
- MYSQL5.6 主从复制
- TensorBoard:嵌入可视化
- 算法系列-大数据面试题-在超大文件中找出访问百度次数最多的IP
- 老哈佛H3的空调控制器的维修记录
- LAMP环境安装rabbitmq
- TensorBoard:图形可视化
- ubuntu编译安装nginx