摘要：面试题19. 正则表达式匹配 1.s[i-1]==p[j-1]dp[i][j] = dp[i-1][j-1]; 2.s[i-1]!=p[j-1]1)p[j-1]=='.''.'是万能字符，可以直接让'.'等于s[i]处的字符dp[i][j] = dp[i-1][j-1];2)p[j-1]=='*'' 阅读全文

摘要：146. LRU缓存机制 class ListNode: def __init__(self, key=None, value=None): self.key = key self.value = value self.prev = None self.next = None class LRUCa 阅读全文

摘要：1 def partition(nums, left, right): 2 if left >= right: 3 return 4 mid = left + (right - left)//2 5 pivot = nums[mid] 6 nums[mid], nums[left] = nums[l 阅读全文