def naive_longest_inc_subseq(seq):
    for length in range(len(seq), 0, -1):
        for sub in combinations(seq, length):
            if list(sub) == sorted(sub):
                return len(sub)
Sanitize a port value.
dataset/ETHPy150Open bt3gl/Python-and-Algorithms-and-Data-Structures/src/USEFUL/dynamic_programming/memoized_longest_inc_subseq.py/naive_longest_inc_subseq--crossover with--dataset/ETHPy150Open google/capirca/lib/port.py/Port