给定起点和终点以及距离,计算沿线的点

import sys

def distance(x1, y1, x2, y2):
    return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5

def dp(start, end, max_distance):
    dp_table = [[0] * (max_distance + 1) for _ in range(len(start) + 1)]
    for i in range(1, len(start) + 1):
        dp_table[i][0] = i
    for j in range(1, max_distance + 1):
        dp_table[0][j] = j
    for i in range(1, len(start) + 1):
        for j in range(1, max_distance + 1):
            if start[i - 1] == end[j - 1]:
                dp_table[i][j] = dp_table[i - 1][j - 1]
            else:
                dp_table[i][j] = min(dp_table[i - 1][j], dp_table[i][j - 1], dp_table[i - 1][j - 1]) + 1
    return dp_table[len(start)][max_distance]

def solve(start, end, max_distance):
    dp_table = [[0] * (max_distance + 1) for _ in range(len(start) + 1)]
    for i in range(1, len(start) + 1):
        dp_table[i][0] = i
    for j in range(1, max_distance + 1):
        dp_table[0][j] = j
    for i in range(1, len(start) + 1):
        for j in range(1, max_distance + 1):
            if start[i - 1] == end[j - 1]:
                dp_table[i][j] = dp_table[i - 1][j - 1]
            else:
                dp_table[i][j] = min(dp_table[i - 1][j], dp_table[i][j - 1], dp_table[i - 1][j - 1]) + 1
    return dp_table[len(start)][max_distance]

start = [1, 1]
end = [5, 4]
max_distance = 6
result = solve(start, end, max_distance)
print(result)