【LeetCode】Reverse Nodes in k-Group
来源:互联网 发布:组织变革 知乎 编辑:程序博客网 时间:2024/06/12 00:53
题目
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组的节点就把前k个节点翻转,代码如下:
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public static ListNode reverseKGroup(ListNode head,int k){ if(head==null||k==1){ return head; } ListNode fakeHead=new ListNode(-1); fakeHead.next=head; ListNode pre=fakeHead; int i=0; while(head!=null){ i++; if(i%k==0){ pre=reverse(pre,head.next); //reverse返回的last就是pre head=pre.next; }else{ head=head.next; } } return fakeHead.next; } private static ListNode reverse(ListNode pre,ListNode next){ //区间的链表反转 ListNode last=pre.next; //last不变 ListNode cur=last.next; //cur移动 while(cur!=next){ last.next=cur.next; cur.next=pre.next; pre.next=cur; cur=last.next; } return last; }}
---EOF---
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
- YII 显示空白内容
- 用eclipse的Hadoop插件连接虚拟机错误: java.net.ConnectException: Connection refused no further infomation
- POJ 1459 Power Network
- 第十六周 项目4 为动态数组扩容
- Android ViewPager自动循环播放
- 【LeetCode】Reverse Nodes in k-Group
- C++实现动态规划求解最长公共子序列
- poj 2724 二部图最大匹配建图(干净的奶酪)
- Java中10种覆盖方法的方式
- 拦截导弹
- rose入门2-Loop Transformation
- 记一次phpcms v9 读取不到session
- makefile简单用例
- C语言下的编程