在序列集合中查找没有NaN值的最长子序列

def find_subsequence(sequence):
    subsequence = []
    max_subsequence = []
    
    for num in sequence:
        if not math.isnan(num):  # 判断是否为NaN值
            subsequence.append(num)
        else:
            if len(subsequence) > len(max_subsequence):
                max_subsequence = subsequence
            subsequence = []
    
    if len(subsequence) > len(max_subsequence):
        max_subsequence = subsequence
    
    return max_subsequence

def find_longest_subsequence(sequence_set):
    longest_subsequence = []
    
    for sequence in sequence_set:
        subsequence = find_subsequence(sequence)
        
        if len(subsequence) > len(longest_subsequence):
            longest_subsequence = subsequence
    
    return longest_subsequence