forPrometheus的博客

class Solution: def isMatch(self, s: str, p: str) -> bool: m, n = len(s), len(p) dp = [[False for j in range(n + 1)] for i in range(m + 1)] dp[0][0] = True def match(i, j): if i == 0: return False .

class Solution: def convert(self, s: str, numRows: int) -> str: if numRows < 2: return s res = ["" for _ in range(numRows)] i, flag = 0, -1 for c in s: res[i] += c if i == 0 or i == numRows.

class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: def getKthElement(k): """ - 主要思路：要找到第 k (k>1) 小的元素，那么就取 pivot1 = nums1[k/2-1] 和 pivot2 = nums2[k/2-1] 进行比较 .

class Solution: def lengthOfLongestSubstring(self, s: str) -> int: res, right = 0, 0 visit = set() for i in range(len(s)): if i > 0: visit.remove(s[i - 1]) while right < len(s) a.

class Solution: def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode: s = 0 dummy = ListNode(0) head = dummy while l1 or l2 or s: print(dummy) s += (l1.val if l1 else 0) + (l2.val i.

class Solution: def longestPalindrome(self, s: str) -> str: if not s: return 0 t = "?#" for c in s: t += c + '#' t += '!' n = len(t) f = [1 for _ in range(n)] res, im , rm = '', 0,.