zoukankan      html  css  js  c++  java
  • 面试17.13恢复空格

    # 动态规划的解法,参考别人的。
    from typing import List
    class Solution:
    def respace(self, dictionary: List[str], sentence: str) -> int:
    d = {}.fromkeys(dictionary,"heheh")
    length = len(sentence)
    f = [0] * (length + 1)
    for index in range(1,length + 1):
    f[index] = f[index - 1] + 1
    for index1 in range(index):
    if sentence[index1:index] in d:
    f[index] = min(f[index],f[index1])
    print(f)
    return f[-1]
    A = Solution()
    # print(A.respace(["looked","just","like","her","brother"],"jesslookedjustliketimherbrother"))
    print(A.respace(["aaysaayayaasyya","yyas","yayysaaayasasssy","yaasassssssayaassyaayaayaasssasysssaaayysaaasaysyaasaaaaaasayaayayysasaaaa","aya","sya","ysasasy","syaaaa","aaaas","ysa","a","aasyaaassyaayaayaasyayaa","ssaayayyssyaayyysyayaasaaa","aya","aaasaay","aaaa","ayyyayssaasasysaasaaayassasysaaayaassyysyaysaayyasayaaysyyaasasasaayyasasyaaaasysasy","aaasa","ysayssyasyyaaasyaaaayaaaaaaaaassaaa","aasayaaaayssayyaayaaaaayaaays","s"],"asasayaayaassayyayyyyssyaassasaysaaysaayaaaaysyaaaa"))
  • 相关阅读:
    1265 四点共面
    1003 阶乘后面0的数量
    1080 两个数的平方和
    1090 3个数和为0
    1087 1 10 100 1000
    1082 与7无关的数
    OpenLayers工作原理
    CI(持续集成)CD(持续交付)
    打包命令
    文件与目录管理重点
  • 原文地址:https://www.cnblogs.com/cong12586/p/13299691.html
Copyright © 2011-2022 走看看