需要在列表中找到第二大值。所有的细节都粘贴在下面的正文中。请协助

def find_second_largest_sort(lst):
    if len(lst) < 2:
        return None
    sorted_lst = sorted(set(lst), reverse=True)
    return sorted_lst[1]

# 示例
lst = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
print(find_second_largest_sort(lst))  # 输出: 6

def find_second_largest_one_pass(lst):
    if len(lst) < 2:
        return None
    first, second = float('-inf'), float('-inf')
    for num in lst:
        if num > first:
            second = first
            first = num
        elif first > num > second:
            second = num
    return second

# 示例
lst = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
print(find_second_largest_one_pass(lst))  # 输出: 6

import heapq

def find_second_largest_heap(lst):
    if len(lst) < 2:
        return None
    return heapq.nlargest(2, set(lst))[1]

# 示例
lst = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
print(find_second_largest_heap(lst))  # 输出: 6

def find_second_largest(lst):
    if len(lst) < 2:
        return None
    # 其他逻辑

def find_second_largest(lst):
    if len(lst) < 2:
        return None
    unique_lst = list(set(lst))
    if len(unique_lst) < 2:
        return None
    # 其他逻辑