摘要：
题目描述： 提交： class Solution: def maxDotProduct(self, nums1: List[int], nums2: List[int]) -> int: n1,n2 = len(nums1),len(nums2) dp = [[0] * n2 for _ in ra 阅读全文
摘要：
题目描述： 提交： class Solution: def pseudoPalindromicPaths (self, root: TreeNode) -> int: def helper(l,node): left,right = 0,0 if node.left == None and node 阅读全文
摘要：
提交： class Solution: def maxVowels(self, s: str, k: int) -> int: n = len(s) dp = [0] * (n + 1) for i in range(n): if s[i] in "aeiou": dp[i + 1] = dp[i] 阅读全文
摘要：
题目描述： 提交： class Solution: def isPrefixOfWord(self, sentence: str, searchWord: str) -> int: n = len(searchWord) sentence_l = sentence.split(" ") for i 阅读全文