K 个一组翻转链表

先将链表放到列表中，再在列表中准换成要求的格式，最后将列表转换成链表的形式

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def reverseKGroup(self, head, k):
        """
        :type head: ListNode
        :type k: int
        :rtype: ListNode
        """
        p = ListNode(0)
        cur = p
        a = []
        while head:
            a.append(head.val)
            head = head.next
        li = [a[i:i + k] for i in range(0, len(a), k)]
        b = []
        for i in li:
            if len(i) == k:
                b.append(i[::-1])
            else:
                b.append(i)
        b = sum(b, [])[::-1]
        while b:
            cur.next = ListNode(b.pop())
            cur = cur.next
        return p.next