[leetcode] 25. Reverse Nodes in k-Group 解题报告
2016-01-08 10:51
531 查看
题目链接:https://leetcode.com/problems/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:
For k = 2, you should return:
For k = 3, you should return:
思路:上了一天课,晚上又连续做了几个小时题,感觉已经意识模糊了,题意看了好久没看懂。
这题是说给一个链表和k,每k个结点作为一段翻转一下。可以先计算出链表的长度,然后可以知道有几个需要翻转的区域,然后循环就地逆置那个区域的链表。如果最后一段剩余的长度小于k了,那就扔那不管了.
代码如下:
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,每k个结点作为一段翻转一下。可以先计算出链表的长度,然后可以知道有几个需要翻转的区域,然后循环就地逆置那个区域的链表。如果最后一段剩余的长度小于k了,那就扔那不管了.
代码如下:
/** * 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 || k<=1) return head; ListNode *pHead=new ListNode(0), *p=pHead, *q=head, *tem; pHead->next = head; int len = 0; while(p->next) p = p->next, len++; p = pHead; while(len>=k) { int step = 1; q = p->next; while(step++ < k) { tem = q->next; q->next = tem->next; tem->next = p->next; p->next = tem; } p = q, len -= k; } head = pHead->next; delete pHead; return head; } };
相关文章推荐
- nodejs使用mongoose
- nodejs base64 编码解码
- nodejs音乐播放器
- 现在学习 JavaScript 的哪种技术更好:Angular、jQuery 还是 Node.js?(转)
- LeetCode Reverse Nodes in k-Group
- windows下node.js安装图文教程
- Node.js
- nodejs安装不了和npm安装不了的解决方法
- Nodejs·理解Buffer
- node运行报错: Error: listen EADDRINUSE :::3000 e
- node+express读书笔记1
- nodejs监控目录
- Node.js学习笔记(一)-认识Node.js
- node.js学习笔记之promise
- [leetcode] 24. Swap Nodes in Pairs 解题报告
- LeetCode 25 - Reverse Nodes in k-Group
- hadoop2.2 datanode 启动不了
- nodejs 中Express 的 send方法
- apidoc 监视文件变动自动生成工具
- Leetcode217: Reverse Nodes in k-Group