mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-02 06:46:18 -04:00
cleanup
This commit is contained in:
parent
4d9c04e61d
commit
1d476139a8
17 changed files with 250 additions and 1 deletions
31
real_interview_problems/longest_increasing_subsequence.py
Normal file
31
real_interview_problems/longest_increasing_subsequence.py
Normal file
|
@ -0,0 +1,31 @@
|
|||
#!/usr/bin/env python
|
||||
|
||||
__author__ = "bt3"
|
||||
|
||||
|
||||
def longest_increasing_subsequence(seq):
|
||||
result, aux = [], []
|
||||
seq.append(-float('infinity'))
|
||||
|
||||
for i, value in enumerate(seq[:-1]):
|
||||
aux.append(value)
|
||||
if value > seq[i+1]:
|
||||
if len(result) < len(aux):
|
||||
result = aux[:]
|
||||
aux = []
|
||||
return result
|
||||
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
seq = [10, -12, 2, 3, -3, 5, -1, 2, -10]
|
||||
result = [-12, 2, 3]
|
||||
assert(longest_increasing_subsequence(seq) == result)
|
||||
|
||||
seq = [2]
|
||||
result = [2]
|
||||
assert(longest_increasing_subsequence(seq) == result)
|
||||
|
||||
seq = []
|
||||
result = []
|
||||
assert(longest_increasing_subsequence(seq) == result)
|
Loading…
Add table
Add a link
Reference in a new issue