Reverse Nodes in k-Group
2014-01-03 14:55
211 查看
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:
For k = 2, you should return:
For k = 3, you should return:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode reverseKGroup(ListNode head, int k) {
// Start typing your Java solution below
// DO NOT write main() function
if(head == null || k <= 1) {
return head;
}
int listLength = 0;
ListNode curr = head;
while(curr != null) {
listLength++;
curr = curr.next;
}
if(listLength < k) {
return head;
}
curr = head;
ListNode pre = null;
int count = k;
while(curr != null && count > 0) {
ListNode post = curr.next;
curr.next = pre;
pre = curr;
curr = post;
count--;
}
head.next = reverseKGroup(curr, k);
return pre;
}
}
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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode reverseKGroup(ListNode head, int k) {
// Start typing your Java solution below
// DO NOT write main() function
if(head == null || k <= 1) {
return head;
}
int listLength = 0;
ListNode curr = head;
while(curr != null) {
listLength++;
curr = curr.next;
}
if(listLength < k) {
return head;
}
curr = head;
ListNode pre = null;
int count = k;
while(curr != null && count > 0) {
ListNode post = curr.next;
curr.next = pre;
pre = curr;
curr = post;
count--;
}
head.next = reverseKGroup(curr, k);
return pre;
}
}
相关文章推荐
- leetcode 25:Reverse Nodes in k-Group
- CODE 107: Reverse Nodes in k-Group
- Reverse Nodes in k-Group
- 每日算法之二十三:Reverse Nodes in k-Group
- leetcode Reverse Nodes in k-Group
- LeetCode--Reverse Nodes in k-Group
- Leetcode: Reverse Nodes in k-Group
- LeetCode No.25 Reverse Nodes in k-Group
- Swap Nodes in Pairs and Reverse Nodes in k-Group
- [Leetcode 25] Reverse Nodes in k Group
- leetcode:Reverse Nodes in k-Group(以k为循环节反转链表)【面试算法题】
- 【Leetcode】Reverse Nodes in k-Group
- Reverse Nodes in k-Group
- leetcode做题总结,题目Reverse Nodes in k-Group 2012/02/15
- 【LeetCode】Reverse Nodes in k-Group
- 025 Reverse Nodes in k-Group [Leetcode]
- leetcode025:Reverse Nodes in k-Group
- Reverse Nodes in k-Group leetcode
- leetcode - Reverse Nodes in k-Group
- Leetcode | Reverse Nodes in k-Group