根据与目标字符串的差异对字符串列表进行排序的最佳方法？

def levenshtein_distance(s1, s2):
    if len(s1) < len(s2):
        return levenshtein_distance(s2, s1)

    if len(s2) == 0:
        return len(s1)

    previous_row = range(len(s2) + 1)
    for i, c1 in enumerate(s1):
        current_row = [i + 1]
        for j, c2 in enumerate(s2):
            insertions = previous_row[j + 1] + 1
            deletions = current_row[j] + 1
            substitutions = previous_row[j] + (c1 != c2)
            current_row.append(min(insertions, deletions, substitutions))
        previous_row = current_row

    return previous_row[-1]

def sort_strings_by_distance(strings, target):
    return sorted(strings, key=lambda s: levenshtein_distance(s, target))

strings = ["apple", "banana", "pear", "orange"]
target = "apricot"
sorted_strings = sort_strings_by_distance(strings, target)
print(sorted_strings)