摘要：
class Solution: def numWays(self, n: int) -> int: x, y = 1, 1 for _ in range(n): x, y = y, x+y return x 阅读全文
摘要：
class Solution: def maxSubArray(self, nums: List[int]) -> int: # 设当前的和为 cur_sum cur_sum = 0 res = nums[0] for num in nums: # 如果当前和大于0 if cur_sum > 0: 阅读全文
摘要：
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def hasCycle(self, h 阅读全文
摘要：
class Solution: def maxArea(self, height: List[int]) -> int: # 双指针，每次移动短指针 i = 0 j = len(height) - 1 res = 0 while i <= j: if height[i] < height[j]: s 阅读全文
摘要：
class Solution: def majorityElement(self, nums: List[int]) -> int: # 摩尔计数法，1、互相抵消 2、计数阶段，不等于0则是重复最多的那个 count = 0 # 票数 res = None for n in nums: if cou 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Co 阅读全文
摘要：
class Solution: def numIslands(self, grid: List[List[str]]) -> int: def one_to_zero(i, j): while i < row and j < col and i >= 0 and j >= 0 and grid[i] 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self. 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: 阅读全文
摘要：
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: 阅读全文