[LeetCode][Java] Reverse Nodes in k-Group
来源:互联网 发布:java定义数组怎么储存 编辑:程序博客网 时间:2024/05/22 14:15
题目:
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的整数倍,那么保持结尾剩余的那些节点不懂。
只允许常数空间。
比如:
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
算法分析:
利用的题目《Reverse Linked List II》的算法,k个元素为一组,进行倒置
AC代码:
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ //利用的题目《Reverse Linked List II》的算法,k个元素为一组,进行倒置 public class Solution { public ListNode reverseKGroup(ListNode head, int k) {if(head==null||k<=1) return head; int startindex=1;int endindex=k;int ki=0;int Allk=0;int kk=0;ListNode testhead=head;while(testhead!=null){kk++;testhead=testhead.next;}Allk=kk/k;while(ki<Allk){head=reverseBetween( head, startindex, endindex); ki++;startindex+=k;endindex+=k;} return head; } public static ListNode reverseBetween(ListNode head, int m, int n) { if(head == null) return null; ListNode dummy = new ListNode(0); dummy.next = head; ListNode preNode = dummy; int i=1; while(preNode.next!=null && i<m) { preNode = preNode.next; i++; } //if(i<m) // return head; ListNode mNode = preNode.next; ListNode cur = mNode.next; while(cur!=null && i<n) { ListNode next = cur.next; cur.next = preNode.next; preNode.next = cur; mNode.next = next; cur = next; i++; } return dummy.next; }}
- [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
- 29. Divide Two Integers
- Exynos4412 Android4.4 HDMI Porting Guid 第二篇
- 一些Android拨号盘的基本代码
- 南阳oj 题目122 Triangular Sums
- 融云SDK 2.2 Android+环境搭建和端对端以及客服聊天的实现
- [LeetCode][Java] Reverse Nodes in k-Group
- c++等级考试管理系统
- Android App的文件缓存目录
- Exynos4412 Android4.4 HDMI Porting Guid 第三篇
- Android 缓存目录
- Algorithms—179.Largest Number
- Android targetSdkVersion 影响 js 的功能
- 引用网络jQuery地址
- IOS - 购买类型视图