LeetCode ( Reverse Nodes in k-Group)
来源:互联网 发布:java并发编程 编辑:程序博客网 时间:2024/06/05 23:40
Problem:
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
/** * 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; int num=0; ListNode *preheader = new ListNode(-1); preheader->next = head; ListNode *cur = preheader, *nex, *pre = preheader; while(cur = cur->next) num++; while(num>=k) { cur = pre->next; nex = cur->next; for(int i=1;i<k;++i) { cur->next=nex->next; nex->next=pre->next; pre->next=nex; nex=cur->next; } pre = cur; num -= k; } return preheader->next; }};
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
- 浅拷贝与深拷贝
- Another Server(BNUOJ 同步赛)
- Kali Linux中前十名的Wifi攻击工具
- BootStrap 基本应用
- web.xml is missing and <failOnMissingWebXml> is set to true
- LeetCode ( Reverse Nodes in k-Group)
- 感觉python好简洁啊。
- AngularJs学习笔记(5)--模块(module)
- VUE第一天基本学习
- 利用caffe训练cifar之训练数据集合生成leveldb
- h5 的video视频控件
- Java NIO 之缓冲区
- Kubernetes编排工具-helm源码分析(helm客户端)
- poj1322 Chocolate(滚动数组dp)