递归。需要用到O(N)存储空间
class Solution {
public:
ListNode* reverseKGroup(ListNode* head, int k) {
if (head == NULL)
return head;
ListNode* left, *right,*newHead;
stack<ListNode*
递归。需要用到O(N)存储空间
class Solution {
public:
ListNode* reverseKGroup(ListNode* head, int k) {
if (head == NULL)
return head;
ListNode* left, *right,*newHead;
stack<ListNode*