LeetCode 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

 

沿用的另一道题目的代码，写的不太好，有空了需要重新写过。

 

/**
 * 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) {

        if (head==null) {
            return null;
        }
        if (k == 1) {
            return head;
        }

        ListNode temp=head;
        ListNode doRe = head, nextList = null, first = null, last = null;
        int i=1;

        while (temp != null) {

            if (i % k == 0) {
                if (i == k) {
                    first = reverseBetween(doRe, i / k, i);

                } else {
                    last.next = reverseBetween(doRe, 1, k);
                }
                last = doRe;
                temp = doRe.next;
                doRe = doRe.next;
            } else {
            //    last = temp;
                temp = temp.next;
            }

            ++i;
        }
        return first==null?doRe:first;

    }
    
    
    public ListNode reverseBetween(ListNode head, int m, int n) {
        if (head==null) {
            return null;
        }
        if(n==m){
            return head;
        }
        ListNode temp=head,doRe = null,second=null,first=null,last=null;
        int i=1;

        while (temp!=null) {
            if (i==m-1) {
                first=temp;
            }
            if (i==m) {
                doRe=temp;
            }
            if (i==n) {
                last=temp;
                second=temp.next;
                if(first!=null) first.next=last;
                last.next=null;

                break;
            }
            ++i;
            temp=temp.next;
        }
        reverse(doRe);
        doRe.next=second;    

        if (m>1) {
            return head;
        }else {
            return last;
        }

    }
    private void reverse(ListNode head) {
        ListNode pre = null,curr,next;

        curr=head;
        if (head==null) {
            return;
        }
        while (curr!=null) {
            next=curr.next;
            curr.next=pre;
            pre=curr;
            curr=next;
        }
    }



}