leetcode--Reverse Nodes in k-Group
来源:互联网 发布:淘宝店铺密码修改 编辑:程序博客网 时间:2024/05/16 15:45
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
Have you met this question in a real interview?
class Solution {public: ListNode *reverseKGroup(ListNode *head, int k) { static int number = 0; vector<ListNode*> v; for(ListNode *lp = head; lp!=NULL; lp=lp->next){ v.push_back(lp); number++; } ListNode *result = NULL; if(number==0||k<=1||number<k) return head; else if(number>=k) { ListNode * tail = result; int i = 0; for(; i<(int)number/k; i++) { for(int j=k*i+(k-1); j>=k*i; j--) { if(j==0) { result = v[j]; tail = result; } else{ tail->next = v[j]; tail = tail->next; } } } if(number%k!=0) tail->next = v[i*k]; return result; } }};
vs上运行可以,但leetcode上提交显示 runtime error??
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
- 【hibernate框架】继承映射
- Linux 用户操作
- CF 55D 数位dp(一个数是组成它的所有位数对应数的倍数)
- maven 下struts 框架搭建(系列一)
- file标签之查询数据库中的内容保存到文件
- leetcode--Reverse Nodes in k-Group
- 安卓开发教程 - 搭建开发环境
- [课程] 物联网导论
- POJ 3398 / UVA 1218 Perfect Service 树形DP
- 【hibernate框架】练习-树状结构设计(非常重要)
- Java—用实例揭示notify()和notifyAll()的本质区别
- UI在Xcode中添加空iPhone6模板
- git指令笔记
- 【struts框架】第一节Action-struts基础