链表
武庸
这个作者很懒,什么都没留下…
展开
-
leetcode 206 链表反转 python
class Solution: def reverseList(self, head:ListNode) -> ListNode: cur, pre = head, None while cur: cur.next, pre, cur = pre, cur, cur.next return pre需要注意的的...原创 2019-07-08 10:21:50 · 153 阅读 · 0 评论 -
leetcode 24:两两交换链表节点 python
def swapPairs(self, head: ListNode) -> ListNode: print(self) pre, pre.next = self, head while pre.next and pre.next.next: a = pre.next b = a.nex...原创 2019-07-08 14:32:40 · 128 阅读 · 0 评论 -
leetcode 141: 检测单链表是否有环 python
class Solution(object): def hasCycle(self, head): """ :type head: ListNode :rtype: bool """ slow=fast=head while slow and fast and fast.next: ...原创 2019-07-08 15:43:40 · 309 阅读 · 0 评论 -
leetcode 92:反转链表II python
class ListNode: def __init__(self, x): self.val = x self.next = None def __str__(self): return 'val:%d' % self.valclass Solution: def reverseBetween(self, head,...原创 2019-07-15 17:15:45 · 280 阅读 · 0 评论 -
leetcode:25 reverse Nodes in k-Group python
dummy = ListNode(0) dummy.next = head pre, tail = dummy, dummy while tail.next: count = k while count and tail: tail, count = tail.next...原创 2019-07-17 17:01:57 · 85 阅读 · 0 评论