摘要: #递归的思路 #最初思路是把该链表分为以k为基数的组,然后每组进行reverse #而每组其实构造是一致的,利用递归即可解决 # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next 阅读全文
posted @ 2022-07-13 15:41 是冰美式诶 阅读(26) 评论(0) 推荐(0)
摘要: #迭代 #1.point.next = swap2 #2.swap1.next = swap2.next #3.swap2.next = swap1 # Definition for singly-linked list. # class ListNode: # def __init__(self, 阅读全文
posted @ 2022-07-13 14:12 是冰美式诶 阅读(28) 评论(0) 推荐(0)