LeetCode高频面试题记录（一）
LeetCode高频面试题记录K 个一组翻转链表 困难class Solution {public: ListNode* reverseKGroup(ListNode* head, int k) { if (head == NULL) return NULL; ListNode *a = head; ListNode *b = head; for (int i = 0; i < k; i++) {//判断是否满足一组k
