leetcode 025 —— 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

思路：多次翻转链表

1.非递归法

class Solution {
public:
	ListNode* reverseKGroup(ListNode* head, int k) {
		if (!head || !head->next||k==1)
			return head;
		ListNode *newhead =new ListNode(0);
		ListNode *pre = newhead;
		pre ->next=head;
		ListNode *start = head;
		ListNode *rec = start;
		ListNode *nex = start->next;
		ListNode *end = head;
		ListNode *tail = end->next;
		while (1){
			int n = k-1;
			while (n--){   //移动到末尾
				end = end->next;
				if (!end) return newhead->next;
			}
			tail = end->next;
			start->next = tail;
			pre->next = end;
			pre = start;
			while (nex != tail){
				rec = nex;
				nex = nex->next;
				rec->next = start;
				start = rec;
			}
			if (!nex)
				break;
			start = nex;
			end = start;
			nex = nex->next;
		}
		return newhead->next;
	}
};

2.递归法




class Solution {
public:
    ListNode *reverseKGroup(ListNode *head, int k) {
    // Start typing your C/C++ solution below
    // DO NOT write int main() function
    int n=k;
    int len=0;
    ListNode *p=head;
    if (head == NULL || head->next == NULL||k<=1) return head;
    while (p)
    {
        len++;
        p=p->next;
    }
    if (n > len) return head;       
    ListNode *q=head;
    p = NULL;       
    while (q && n>0)    //深刻理解翻转链表的思想    p为首地址 
    {
        ListNode *ne=q->next;
        q->next = p;
        p=q;
        q=ne;
        n--;
    }
    if (len - k >= k)
        head->next = reverseKGroup(q,k);
    else
        head->next = q;
    return p;
  }
};