我有一个问题，其中有n块塔的数量。

4 3 0 1 1

答案是1个移动

对于以下问题：

7 0 0 0 1

答案是3个动作：7 1 0 0 0或6 1 1 0 0。

我当前具有此功能：

def compute_min_moves(towers, moves = 0):
    # Si 0 o 1 torre, no se hace nada
    if len(towers) < 2:
        return moves

    for i in range(len(towers)-1, 0 ,-1):
        if towers[i - 1] < towers[i]:
            diff = 0
            while towers[i - 1] < towers[i]:
                diff += 1
                towers[i - 1] += diff
                towers[i] -= diff
                moves += diff   
           
            sub_array = towers[i-1:]
            if not all(earlier >= later for earlier, later in zip(sub_array, sub_array[1:])):
                moves = compute_min_moves(towers, moves)

    return moves

我看不到我们如何获得最佳解决方案。

• min