摘要：
题目描述： 方法一：动态规划 class Solution: def minCut(self, s: str) -> int: min_s = list(range(len(s))) n = len(s) dp = [[False] * n for _ in range(n)] for i in r 阅读全文
摘要：
题目描述： class Solution: def findLadders(self, beginWord: str, endWord: str, wordList: list) -> list: wordList = set(wordList) # 转换为hash实现O(1)的in判断 if en 阅读全文