leetcode 25. Reverse Nodes in k-Group
来源:互联网 发布:网络安全问题及看法 编辑:程序博客网 时间:2024/05/14 03:15
1.题目
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
将一个链表一次反转k个节点直到结束。
2.思路
用一个计数器count,每当计数器count的值达到k,就将这k个节点反转;
要反转这k个节点,需要知道这k个节点的头节点和尾节点,分别用start和end表示,还需要知道这k个节点的前一个节点,以完成前后链表的链接,用pre表示,代码如下。
class Solution {public: ListNode* reverseK(ListNode* start, ListNode* end,ListNode* pre) { // 反转以start开头,end结束的k个节点,返回反转后k个节点的尾节点ListNode* tail = start;ListNode *tmp;while (start != end){tmp = start->next;start->next = end->next;end->next = start;start = tmp;}pre->next = end;return tail;}ListNode* reverseKGroup(ListNode* head, int k) {ListNode *newhead = new ListNode(-1);ListNode *pre = newhead,*cur = head,*start = head,*end = head;int count = 1;while (cur){if (count == 1)start = cur;if (count == k){end = cur;cur = start;pre = reverseK(start, end, pre);count = 0;}cur = cur->next; count++;}return newhead->next;}};
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
- 通过IntentService读取收获地址省市县信息存入数据库
- java反射机制理解-上
- Alluxio源码分析:RPC框架浅析(一)
- Android官方开发文档Training系列课程中文版:管理Activity的生命周期之暂停和恢复Activity
- Function overloaded in C++
- leetcode 25. Reverse Nodes in k-Group
- Android 自定义RatingBar
- POSIX多线程程序设计_流水线工作例程
- 【php数组 面试题】无下标数组赋值问题
- 配置Hadoop2.x的HDFS、MapReduce来运行WordCount程序
- 为什么margin-top不是作用于父元素
- c语言基本数据类型
- 剑指 offer代码解析——面试题37两个链表的第一个公共结点
- 玩游戏经常弹出到桌面的解决方案