LeetCode 25: Reverse Nodes in k-Group

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseKGroup(ListNode head, int k) {
        if (head == null || head.next == null) {
            return head;
        }
        
        ListNode result = new ListNode(0);
        ListNode tail = result;
        int count = k;
        while (head != null) {
            count = k;
            ListNode runner = head;
            if (!canReverse(runner, k)) {
                break;
            }
            
            while(count-- > 0) {
                runner = head;
                head = head.next;
                runner.next = tail.next;
                tail.next = runner;
            }
            
            while (tail.next != null) {
                tail = tail.next;
            }
        }
        
        if (head != null) {
            tail.next = head;
        }
        return result.next;
    }
    
    private boolean canReverse(ListNode head, int num) {
        while (num-- > 0) {
            if (head == null) {
                return false;
            }
            head = head.next;
        }
        return true;
    }
}