[leetcode] Reverse Nodes in k-Group

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

 

思路：记录起始位置和结束位置，找到第k的倍数个节点的时候为需要逆转片段的结束位置，下一个节点为下一次需要逆转片段的起始位置。建立起始位置到结束位置的逆向链表，并与总链表连接即可。


 

注意：如果最后一个节点不属于结束标记，则从记录的起始位置开始直接连接到总链表即可。

 

class Solution
{
public:
  ListNode *reverseKGroup(ListNode *head, int k)
  {
    ListNode *ptr = head, *s_ptr = head, *e_ptr = NULL;
    ListNode *ret = NULL, *temp = NULL;
    ListNode *t_head = NULL, *t_ptr = NULL, *t_end = NULL;

    int count = 1;
    while(ptr != NULL)
    {
      if(count%k == 0)
      {
        e_ptr = ptr;
        ptr = ptr->next;
        e_ptr->next = NULL;

        t_end = s_ptr;
        while(s_ptr)
        {
          if(t_head == NULL)
          {
            t_head = s_ptr;
            s_ptr = s_ptr->next;
            t_head->next = NULL;
            t_ptr = t_head;
          }
          else
          {
            t_head = s_ptr;
            s_ptr = s_ptr->next;
            t_head->next = NULL;
            t_head->next = t_ptr;
            t_ptr = t_head;
          }
        }
        t_end->next = NULL;

        if(ret == NULL)
        {
          ret = t_head;
          temp = t_end;
        }
        else
        {
          temp->next = t_head;
          temp = t_end;
        }

        t_head = NULL;
        t_end = NULL;
        t_ptr = NULL;
        s_ptr = ptr;
      }
      else
      {
        ptr = ptr->next;
        if(ptr == NULL)
        { 
          if(ret == NULL)
            ret = s_ptr;
          else
            temp->next = s_ptr;
        }
      }
      count++;
    }

    return ret;
  }
};