从列表中获取最长的子类别链

class Category:
    def __init__(self, id, parent_id):
        self.id = id
        self.parent_id = parent_id

def get_longest_subcategory_chain(categories):
    category_map = {}
    for category in categories:
        category_map[category.id] = category

    longest_chain_length = 0
    longest_chain_start = None
    longest_chain_end = None

    def dfs(category_id, chain_length, chain_start):
        nonlocal longest_chain_length, longest_chain_start, longest_chain_end
        if chain_length > longest_chain_length:
            longest_chain_length = chain_length
            longest_chain_start = chain_start
            longest_chain_end = category_id

        if category_id in category_map:
            parent_id = category_map[category_id].parent_id
            if parent_id != -1:
                dfs(parent_id, chain_length + 1, chain_start)

    for category in categories:
        if category.parent_id == -1:
            dfs(category.id, 1, category.id)

    longest_chain = []
    current_category_id = longest_chain_end
    while current_category_id != longest_chain_start:
        longest_chain.insert(0, current_category_id)
        current_category_id = category_map[current_category_id].parent_id
    longest_chain.insert(0, longest_chain_start)

    return longest_chain

# 示例用法
categories = [
    Category(1, -1),
    Category(2, 1),
    Category(3, 2),
    Category(4, 3),
    Category(5, 4),
    Category(6, 5),
    Category(7, 6),
    Category(8, 7),
    Category(9, 8),
    Category(10, 9)
]

longest_chain = get_longest_subcategory_chain(categories)
print(longest_chain)