Reverse Nodes in k-Group_Leetcode_#25
来源:互联网 发布:php location地址跳转 编辑:程序博客网 时间:2024/05/21 21:01
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
2 解法
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode reverseKGroup(ListNode head, int k) { int count = 0; ListNode pCurr = head; while(pCurr != null && count != k){ ++count; pCurr = pCurr.next; } if(count == k){ pCurr = reverseKGroup(pCurr, k); while(count-- > 0){ ListNode pTemp = head.next; head.next = pCurr; pCurr = head; head = pTemp; } head = pCurr; } return head; }}
0 0
- Reverse Nodes in k-Group_Leetcode_#25
- LeetCode(25)Reverse Nodes in K-Group
- [leetcode 25]Reverse Nodes in k-Group
- 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
- 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
- #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
- 25Reverse Nodes in k-Group
- 关于微信社群,这里有几点想说...
- 软键盘控制笔记(一)
- hadoop-2.6.0动态添加新节点
- 木框木字的制作——盗墓笔记
- 【DRP学习总结】Hello Oracle!
- Reverse Nodes in k-Group_Leetcode_#25
- 多线程之公牛的生产与宰杀(消费者与生产者)
- EUI中控件使用过程中遇到的问题
- House Robber Series
- SQLServer一行多列求最大值
- POJ-2001 Shortest Prefixes(Trie树)
- 帧动画,补间动画,和属性动画
- 如何做一个简易的ATM机
- 敌兵布阵