Python:列表的子集尽可能均匀分布？

def evenly_distribute_subsets(lst, n):
    m = len(lst)
    subset_size = m // n
    remaining_elements = m % n
    subsets = []

    start = 0
    for i in range(n):
        subset_length = subset_size + (1 if i < remaining_elements else 0)
        subset = lst[start:start+subset_length]
        subsets.append(subset)
        start += subset_length

    return subsets

# 示例用法
original_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
num_subsets = 3
result = evenly_distribute_subsets(original_list, num_subsets)
print(result)