摘要：
""" # Definition for a Node. class Node: def __init__(self, val, left=None, right=None): self.val = val self.left = left self.right = right """ class 阅读全文
摘要：
def merge_sort(a, left, right): if left == right: return [a[left]] mid = left + (right-left) // 2 l1 = merge_sort(a, left, mid) l2 = merge_sort(a, mid 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def 阅读全文
摘要：
class Solution: def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode: cur = dummy = ListNode(0) while l1 and l2: if l1.val < l2.val: cur.ne 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def removeDuplicateN 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def deleteNode(self, 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def getKthFromEnd(se 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def getIntersectionN 阅读全文
摘要：
""" # Definition for a Node. class Node: def __init__(self, x: int, next: 'Node' = None, random: 'Node' = None): self.val = int(x) self.next = next se 阅读全文