[Leetcode] Reverse Nodes in k-Group (Java)
来源:互联网 发布:isis知乎 编辑:程序博客网 时间:2024/06/09 21:34
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
链表逆序,遍历时把遍历到的node放在首位,最后一个就成为了第一个,第一个成为最后一个
public class ReverseNodesinkGroup {static class ListNode {int val;ListNode next;ListNode(int x) {val = x;next = null;}}public ListNode reverse(ListNode pre,ListNode next){ListNode last = pre.next;ListNode cur = last.next;while(cur!= next){last.next = cur.next;cur.next = pre.next;pre.next = cur;cur = last.next;}return last;}public ListNode reverseKGroup(ListNode head, int k) {if(k<=1||head==null)return head;ListNode res = new ListNode(-1);res.next = head;int i=0;ListNode pre = res;while(head!=null) {i++;if(i%k==0){pre = reverse(pre, head.next);head = pre.next;}else {head = head.next;}}return res.next;}public static void main(String[] args) {ListNode l1 = new ListNode(1);ListNode l2 = new ListNode(2);ListNode l3 = new ListNode(3);ListNode l4 = new ListNode(4);ListNode l5 = new ListNode(5);l1.next=l2;l2.next=l3;l3.next=l4;l4.next=l5;int k = 3;ListNode res = new ReverseNodesinkGroup().reverseKGroup(l1, k);if(res!=null){System.out.print(res.val);res=res.next;}while(res!=null){ System.out.print("->"+res.val);res=res.next;}}}
0 0
- [Leetcode] Reverse Nodes in k-Group (Java)
- [LeetCode][Java] Reverse Nodes in k-Group
- LeetCode : Reverse Nodes in k-Group [java]
- Reverse Nodes in k-Group leetcode java
- [LeetCode] 025. Reverse Nodes in k-Group (Hard) (C++/Java)
- (Java)LeetCode-25. Reverse Nodes in k-Group
- [LeetCode] 25. Reverse Nodes in k-Group java
- 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
- Linux中eclipse配置编译TBB
- 【iOS】字符串NSString中去掉空格
- springSecurity的登录验证
- unity3d什么的书籍比较好,unity3d游戏开发书籍汇总
- 卡尔曼滤波算法程序
- [Leetcode] Reverse Nodes in k-Group (Java)
- 放弃MySQL的五大理由
- WEB应用中的SESSION知多少?
- 基于堆积树的选择排序(Heap排序法)
- (转)fatal error C1853: precompiled header file is from a previous version of the compiler, or the pre
- 可信平台的基本特性
- Android应用程序签名和权限增强应用程序安全性
- 移动智慧梦想未来(一)——O2O未来,Passbook集成(网络创建Pass文件)
- 初识JSON