摘要：题目描述： 方法一;回溯 class Solution: def exist(self, board: List[List[str]], word: str) -> bool: max_x,max_y,max_step = len(board)-1,len(board[0])-1,len(word) 阅读全文

摘要：题目描述： 第一次提交;超时 class Solution: def jump(self, nums: List[int]) -> int: l = [] for i in range(len(nums)): l.append(i) for i, v in enumerate(nums): for 阅读全文

摘要：题目描述： 第一次提交： class Solution: def canJump(self, nums: List[int]) -> bool: if len(nums)<=1: return True for i,v in enumerate(nums): if i == 0 and v == 0 阅读全文

摘要：似然概率https://blog.csdn.net/u014182497/article/details/82252456 极大似然https://blog.csdn.net/qq_32742009/article/details/81460815 最大后验概率估计https://blog.csdn 阅读全文