[LeetCode-JAVA] Reverse Nodes in k-Group

题目：

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个的时候将其反转

思路：写一个reverse链表的方法，每当符合条件的时候调用方法即可。

代码：（自己第一次写的比较繁琐，下面有精简版）

public class Solution {public ListNode reverseKGroup(ListNode head, int k) {if(head == null)return null;ListNode cur = head;   //记录要反转的头ListNode dep = head;    //保存原始headListNode curPre = new ListNode(0);  // cur的前一个指针 其next为反转后的头ListNode req = null; // 如果有反转的话 记录第一次的头 即最终要返回的int count = k; // 记录next次数 while(head != null){head = head.next;count--;if(count == 0){  //有k个非空 符合要求ListNode temp = reverse(cur, k);if(req == null)  //第一次反转 记录其头req = temp;curPre.next = temp;cur.next = head;count = k;  //计数重置curPre = cur; //保存前一个指针cur = head;continue;}}return req == null ? dep : req;}public ListNode reverse(ListNode head, int k){ListNode dunmy = null;while(k > 0){ListNode temp = head.next;head.next = dunmy;dunmy = head;head = temp;k--;}return dunmy;}
}

精简之后代码（为了简化判断部分，在reverser中传入了前一个节点）

private static ListNode reverse(ListNode pre, ListNode next){ListNode last = pre.next;//where first will be doomed "last"ListNode cur = last.next;while(cur != next){last.next = cur.next;cur.next = pre.next;pre.next = cur;cur = last.next;}return last;}public static ListNode reverseKGroup(ListNode head, int k) {if(head == null || k == 1)return head;ListNode dummy = new ListNode(0);dummy.next = head;int count = 0;ListNode pre = dummy;ListNode cur = head;while(cur != null){count ++;ListNode next = cur.next;if(count == k){pre = reverse(pre, next);count = 0;   }cur = next;}return dummy.next;}

参考链接：http://www.cnblogs.com/springfor/p/3864530.html

转载于:https://www.cnblogs.com/TinyBobo/p/4554705.html

[LeetCode-JAVA] Reverse Nodes in k-Group相关推荐

【重点】LeetCode 25. Reverse Nodes in k-Group
LeetCode 25. Reverse Nodes in k-Group 博客转载自:http://www.cnblogs.com/grandyang/p/4441324.html Solution ...
LeetCode 25 Reverse Nodes in k-Group Add to List （划分list为k组）
题目链接: https://leetcode.com/problems/reverse-nodes-in-k-group/?tab=Description Problem :将一个有序list划分为k ...
LeetCode - 25. Reverse Nodes in k-Group
25. Reverse Nodes in k-Group Problem's Link -------------------------------------------------------- ...
leetcode 25. Reverse Nodes in k-Group | 25. K 个一组翻转链表（Java）
题目 https://leetcode.com/problems/reverse-nodes-in-k-group/ 题解乍一看以为很容易:每 k 个节点翻转,若剩余不足 k 个,则不变.没有什么技 ...
【LeetCode】863. All Nodes Distance K in Binary Tree 解题报告（Python）
[LeetCode]863. All Nodes Distance K in Binary Tree 解题报告(Python) 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http ...
25. Reverse Nodes in k-Group
https://leetcode.com/problems/reverse-nodes-in-k-group/description/ 题意:给一个链表和一个正数k,将链表划分成多个长度为k的链,将这 ...
LeetCode之Reverse String II
1.题目 Given a string and an integer k, you need to reverse the first k characters for every 2k charac ...
LeetCode 974. 和可被 K 整除的子数组（哈希map）
1. 题目给定一个整数数组 A,返回其中元素之和可被 K 整除的(连续.非空)子数组的数目. 示例: 输入:A = [4,5,0,-2,-3,1], K = 5 输出:7 解释: 有 7 个子数组满 ...
LeetCode 862. 和至少为 K 的最短子数组（前缀和+deque单调栈）
1. 题目返回 A 的最短的非空连续子数组的长度,该子数组的和至少为 K . 如果没有和至少为 K 的非空子数组,返回 -1 . 示例 1: 输入:A = [1], K = 1 输出:1示例 2: ...
LeetCode 541. Reverse String II
题目: Given a string and an integer k, you need to reverse the first k characters for every 2k charact ...

[LeetCode-JAVA] Reverse Nodes in k-Group

[LeetCode-JAVA] Reverse Nodes in k-Group相关推荐

最新文章

热门文章