摘要：题目描述： dfs： class Solution: def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]: initColor = image[sr][sc] 阅读全文

摘要：题目描述： 提交： class Solution: def countBinarySubstrings(self, s: str) -> int: if not s: return 0 res = 0 count = [0,0] for i in range(len(s)): num = int(s 阅读全文

摘要：题目描述： 方法一：双指针 O(N) O(1) class Solution: def getWinner(self, arr: List[int], k: int) -> int: strike = 0 cur, i = 0, 1 while i < len(arr): if arr[i] < a 阅读全文

摘要：题目描述： 方法一：排序滑窗 class Solution: def smallestRange(self, nums: List[List[int]]) -> List[int]: lst = [] for i in range(len(nums)): for j in range(len(num 阅读全文

摘要：题目描述： 方法一：数学 O(1) O(1) class Solution: def integerBreak(self, n: int) -> int: if n <= 3: return n - 1 a, b = n // 3, n % 3 if b == 0: return int(math. 阅读全文

摘要：方法：后序遍历 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left 阅读全文