快速排序

def solve(nums):
    nums = list(map(int, nums.split(',')))
    n = len(nums)
    left_max = [0] * n
    right_min = [float('inf')] * n
    for i in range(1, n):
        left_max[i] = max(left_max[i - 1], nums[i - 1])
    for i in range(n - 2, -1, -1):
        right_min[i] = min(right_min[i + 1], nums[i + 1])
    result = []
    for i in range(n):
        if nums[i] > left_max[i] and nums[i] < right_min[i]:
            result.append(nums[i])
    print(len(result))
    if result:
        print(' '.join(map(str, sorted(result))))