Leetcode 25. Reverse Nodes in k-Group

題目描述：就是在前一題翻轉2個鏈表節點的題目上變成翻轉k個位置。 題目鏈接：Leetcode 25. Reverse Nodes in k-Group 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:

>>阅读原文<<