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

做这道题的时候一定要注意边界条件，以及函数的编写

public ListNode reverseKGroup(ListNode head, int k) {
		if(head == null || head.next == null || k<= 1) {
			return head;
		}
		ListNode tempHead = new ListNode(0);
		ListNode p = head;
		ListNode tail = tempHead;
		while(p != null) {
			ListNode temp = p;
			int i=1;
			for(i=1; i<k && p.next != null; i++) {
				p = p.next;
			}
			if(i!=k) {
				tail.next = temp;
				return tempHead.next;
			}
			p = p.next;
			ListNode[] reverseArr = reverseList(temp, p);
			tail.next = reverseArr[0];
			tail = reverseArr[1];
		}
        return tempHead.next;
    }
	
	private ListNode[] reverseList(ListNode head, ListNode tail) {
		ListNode[] result = new ListNode[2];
		result[1] = head;	//wei
		ListNode tempHead = new ListNode(0);
		ListNode p = head;
		ListNode pTemp = p.next;
		while(p != null && p!= tail) {
			p.next = tempHead.next;
			tempHead.next = p;
			p = pTemp;
			if(pTemp != null) {
				pTemp = pTemp.next;
			}
		}
		result[0] = tempHead.next;
		return result;
	}