Ejemplos de longest_increasing_subsequence en Python

Ejemplo n.º 1

Archivo: test_dp.py Proyecto: achapkowski/algorithms

 def test_longest_increasing_subsequence(self):
     sequence = [1, 101, 10, 2, 3, 100, 4, 6, 2]
     self.assertEqual(5, longest_increasing_subsequence(sequence))

Ejemplo n.º 2

Archivo: test_dp.py Proyecto: BME-MIT-IET/iet-hf2021-bytes

 def test_longest_increasing_subsequence(self):
     sequence = [1, 101, 10, 2, 3, 100, 4, 6, 2]
     self.assertEqual(5, longest_increasing_subsequence(sequence))

Ejemplo n.º 3

Archivo: 9.DP_longest_increase.py Proyecto: seanlab1/algorithms-1

"""
Given an unsorted array of integers, find the length of longest increasing subsequence.
Example:
Input: [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
The time complexity is O(n^2).
"""

from algorithms.dp import longest_increasing_subsequence

a = [10, 9, 2, 5, 3, 7, 101, 18]

print(longest_increasing_subsequence(a))