摘要：
class Solution: def climbStairs(self, n: int) -> int: # 斐波拉且数列 prev, current = 0, 1 for i in range(n): prev, current = current, prev + current return current 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def deleteDuplicates(self, head: ListNode) -> ListNode: current = head 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def isSymmetric(... 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def minDepth(self, root: TreeNode) -> int: if root 阅读全文