Reverse Nodes in k-Group
2015-06-04 19:33
387 查看
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:
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
/** * 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 == NULL || k < 2) { return head; } ListNode *p = head; int step = k - 1; while (step > 0 && p != NULL) { p = p->next; step--; } if (p == NULL) { return head; } ListNode *KNode = p; p = head; ListNode *q = p->next; while (p != KNode) { ListNode *r = q->next; q->next = p; p = q; q = r; } head->next = reverseKGroup(q, k); return p; } };
相关文章推荐
- nodejs(npm)——创建全局链接
- 一个强大的UI node 抽象
- nodejs——require单次加载
- nodejs创建包(建立nodejs工程)
- nodejs exports和module.exports区别
- Reverse Nodes in k-Group
- DrawNode遮罩
- first step of kubernetes on ubuntu for single node
- drupal node机制理解
- Populating Next Right Pointers in Each Node
- node包管理相关
- Remove Nth Node From End of List
- ubuntu下载并安装phantomjs和nodejs
- Cloudera Manager5配置管理之配置Namenode 的HA
- node.js 简介
- [浅学] 1、Node.js尝试_安装&运行第一个helloworld
- NameNode工作机制和DataNode副本工作机制
- Hadoop之——执行start-all.sh时namenode没有启动
- nodejs npm命令行总结
- ubuntu 下 pm2 error /usr/bin/env: node: No such file or directory解决方案