LeetCode第25题：k个一组翻转链表（JAVA实现）

题目：

网络解答：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    /**
     * @param head a ListNode
     * @param k an integer
     * @return a ListNode
     */
    public ListNode reverseKGroup(ListNode head, int k) {
        // Write your code here

        if(k==1)
            return head;
        if(head==null || head.next==null)
            return head;
        int kk = k;
        ListNode newHead = null;
        ListNode p = head;
        ListNode prev = null;
        ListNode pNext =null;
        int size = size(head);
        if(size<k)
            return head;
        while(k>=1){
            k--;
            pNext = p.next;
            if(k==0){
                newHead = p;
            }
            p.next = prev;
            prev = p;
            p = pNext;
        }
        ListNode lastNode = newHead;
        while(lastNode.next!=null){
            lastNode = lastNode.next;
        }
        ListNode nextHead = reverseKGroup(pNext,kk);
        lastNode.next = nextHead;
        return newHead;

    }
    public int size(ListNode head){
        int i = 0;
        while(head!=null){
            i++;
            head = head.next;
        }
        return i;
    }
}

我的解答：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    /**
     * @param head a ListNode
     * @param k an integer
     * @return a ListNode
     */
    public ListNode reverseKGroup(ListNode head, int k) {
        if(k==1){
            return head;
        }
        ListNode pLast=kNext(head,k-1);
        ListNode list1=new ListNode(0);
        list1.next=head;
        ListNode list2=list1;
        while(pLast!=null){
            ListNode nextHead=kNext(head,k);
            for(int i=k;i>1;i--){
                ListNode pTmp=kNext(head,i-1);
                pTmp.next=null;
                list2.next=pTmp;
                list2=list2.next;
            }
            head.next=nextHead;
            list2.next=head;
            list2=list2.next;
            head=list2.next;
            pLast=kNext(head,k-1);
        }
        return list1.next;
    }
    public ListNode kNext(ListNode p,int k){
        if(k>0){
            for(int i=0;i<k;i++){
                if(p==null){
                    return null;
                }else{
                    p=p.next;
                }
            }
        }
        return p;
    }
}