LeetCode第25题:Reverse Nodes in k-Group（C++详解）

25. 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.

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

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

Note:

Only constant extra memory is allowed.
You may not alter the values in the list’s nodes, only nodes itself may be changed.

题目解析：

就是按k的长度反转给定的链表，写个反转k个节点的函数，然后返回新节点，接下来继续遍历整个链表；我画个简图，描述反转函数。

ListNode* reverseList(ListNode* head, ListNode* tail) {
        ListNode * pre = tail;
        while(head != tail)
        {
            ListNode * t = head->next;
            head->next = pre;
            pre = head;
            head = t;
        }
        return pre;
    }

题目代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        ListNode* cur = head;
        for(int i=0;i<k;i++)
        {
            if(!cur) return head;
            cur = cur->next;
        }
        ListNode * curNode = reverseList(head,cur);
        head->next = reverseKGroup(cur,k);
        return curNode;
    }
    
    ListNode* reverseList(ListNode* head, ListNode* tail) {
        ListNode * pre = tail;
        while(head != tail)
        {
            ListNode * t = head->next;
            head->next = pre;
            pre = head;
            head = t;
        }
        return pre;
    }
};

性能：

总结：昨天参加世界人工智能大会，见到了贾杨清，很年轻，期待明年；返回正题，算法题真的是考察基本功，天天做项目，沦为需求开发，忽视技术，得继续加油，Fighting！