笔试算法题

def numberOfArr(a,m,k):#a: list[int], m: int, k: int) -> int:
    # dp[i][j]表示前i个数字变动j次所有可能次数
    n = len(a)
    dp = [[0] * (k + 1) for _ in range(n)]
    # 当遍历到a[i]时，其+1最多变动u = min(j,m-a[i])次，-1最多变动v = min(j,a[i]-1)次
    # dp[i][j] = sum(dp[i-1][j-t] for t in range(u+1)) + sum(dp[i-1][j-s] for s in range(1,v+1))
    for i in range(k + 1):
        if i < m - a[0]:
            dp[0][i] += 1
        if a[0] - 1 > i > 0:
            dp[0][i] += 1
    for j in range(n):
        dp[j][0] = 1
    for i in range(1, n):
        for j in range(1, k + 1):
            u = min(j, m - a[i])
            v = min(j, a[i] - 1)
            dp[i][j] = (sum(dp[i - 1][j - t] for t in range(u + 1)) + sum(
                dp[i - 1][j - s] for s in range(1, v + 1))) % (10 ** 9 + 7)
    return sum(dp[n - 1][j] for j in range(k + 1)) % (10 ** 9 + 7)