# leetcode25 Reverse Nodes in k-Group

### Reverse Nodes in k-Group

Total Accepted: 47206 Total Submissions: 181287 Difficulty: Hard

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

 

/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution {
public static ListNode reverse(ListNode p, int k) {
ListNode pre = new ListNode(-1);
ListNode px = p;
ListNode q = px.next;
for (int i = 0; i < k ; i++) {
q = px.next;
px.next = pre.next;
pre.next = px;
px = q;
}
return pre.next;
}
public ListNode reverseKGroup(ListNode head, int k) {
}
ListNode pre = new ListNode(-1);
ListNode startpre = pre;
//ListNode prem = pre;
ListNode pm = p;
// boolean flag = false;
int count = 0;
while(r!=null){
r = r.next;
count++;
}
if(count<k){
}
while(true){
int i;
for( i=0;i<k && pm!=null;i++){
//prem = pm;
pm = pm.next;
}
/*if(pm==null && i<k &&flag == false){
}
if(pm==null && i>=k && flag == false){
ListNode x = reverse(p, k);
pre.next = x;
}*/
if(i>=k ){
//	flag = true;
ListNode x = reverse(p, k);
pre.next = x;
/*pre = prem;*/
for(int j=0;j<k;j++){
pre = pre.next;
}
pre.next = pm;
p = pm;
}
if(i<k){

break;
}
}
return startpre.next;
}
}

 

package lianbiaofanzhuan;

public class Solution {
public static ListNode create(int[] a) {
for (int i = 1; i < a.length; i++) {
ListNode q = new ListNode(a[i]);
p.next = q;
p = q;
}
}

public static void display(ListNode head) {
while (p != null) {
System.out.println(p.val);
p = p.next;
}
}

public static ListNode reverse(ListNode head) {
ListNode pre = new ListNode(-1);
ListNode q;
while (p != null) {
q = p.next;
p.next = pre.next;
pre.next = p;
p = q;
}
return pre.next;
}

public static ListNode reverse(ListNode p, int k) {
ListNode pre = new ListNode(-1);
ListNode px = p;
ListNode q = px.next;
for (int i = 0; i < k ; i++) {
q = px.next;
px.next = pre.next;
pre.next = px;
px = q;
}
return pre.next;
}
public static ListNode reverseKGroup(ListNode head, int k) {
}
ListNode pre = new ListNode(-1);
ListNode startpre = pre;
//ListNode prem = pre;
ListNode pm = p;
// boolean flag = false;
int count = 0;
while(r!=null){
r = r.next;
count++;
}
if(count<k){
}
while(true){
int i;
for( i=0;i<k && pm!=null;i++){
//prem = pm;
pm = pm.next;
}
/*if(pm==null && i<k &&flag == false){
}
if(pm==null && i>=k && flag == false){
ListNode x = reverse(p, k);
pre.next = x;
}*/
if(i>=k ){
//	flag = true;
ListNode x = reverse(p, k);
pre.next = x;
/*pre = prem;*/
for(int j=0;j<k;j++){
pre = pre.next;
}
pre.next = pm;
p = pm;
}
if(i<k){

break;
}
}
return startpre.next;
}

public static void main(String[] args) {
int[] a = { 1, 2};
System.out.println();

}

}

class ListNode {
int val;
ListNode next;

ListNode(int x) {
val = x;
}
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：leetcode25 Reverse Nodes in k-Group 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)