动态规划入门经典问题（python版）

-777.

已于 2023-12-19 20:14:23 修改

阅读量358

点赞数 10

文章标签： python 动态规划

于 2023-12-17 17:21:50 首次发布

本文链接：https://blog.csdn.net/2301_76481489/article/details/135046699

版权

1.最长公共子序列问题

编写一个函数lcs，接受两个字符串A和B作为参数，返回A和B中的最长公共子序列。

def  lcs(A, B):
        m = len(A)
        n = len(B)
        L = [[0] * (n+1) for i in range(m+1)]
        for i in range(1, m+1):
            for j in range(1, n+1):
                if A[i-1] == B[j-1]:
                    L[i][j] = L[i-1][j-1] + 1
                else:
                    L[i][j] = max(L[i-1][j], L[i][j-1])
        s = ''
        while L[i][j] > 0:
            if L[i][j] == L[i-1][j]:
                i -= 1
            elif L[i][j] == L[i][j-1]:
                j -= 1
            else:
                s = A[i-1] + s
                i -= 1
                j -= 1
        return s

2.0-1背包问题

0-1背包问题 + 返回背包物品

def bagValue(C, n, W, V):
    # 计算放入包中的物品的最大价值
    bv = [[0 for j in range(C+1)] for i in range(n+1)]
    for i in range(1, n+1):		# i是物品编号，从1开始
        for j in range(1, C+1):	# j是背包容量，从1开始
            if W[i-1] <= j:		# 如果当前物品所需空间小于等于j
                bv[i][j] = max(bv[i-1][j], bv[i-1][j-W[i-1]] + V[i-1])
            else:
                bv[i][j] = bv[i-1][j]
    # 价值最大时，标记有哪些物品放入包中
    selectedObject = [False for i in range(n)]
    j = C
    for i in range(n, 0, -1):
        if bv[i][j] != bv[i-1][j]:
            selectedObject[i-1] = True
            j -= W[i-1]
    return selectedObject, bv

3.找零问题

编写一个函数dpMakeChange，接收硬币面值列表coinValueList和找零金额change两个参数，返回change对应的最少硬币数的找零详情字典（包含所用的每种硬币面值和个数）。

def dpMakeChange(coinValueList, change):
        minCoins = [0] * (change + 1)
        coinsUsed = {}
        for cents in range(change + 1):
            coinCount = cents
            newCoin = 1
            for j in [c for c in coinValueList if c <= cents]:
                if minCoins[cents - j] + 1 < coinCount:
                    coinCount = minCoins[cents - j] + 1
                    newCoin = j         
            minCoins[cents] = coinCount
            coinsUsed[cents] = newCoin
        changeDetails = {}
        while change > 0:
            thisCoin = coinsUsed[change]
            if thisCoin in changeDetails:
                changeDetails[thisCoin] += 1
            else:
                changeDetails[thisCoin] = 1
            change -= thisCoin
        return changeDetails