Find the longest increasing subsequence.

Share

Home>ICT>Python by ...>Find the l...

Find the longest increasing subsequence in a data file.

1
# Author: HUANG KWUN HOI (SKHBBSS, class 4D)
2
# Last modified: 2020.9.8
3
file1=open('data2.txt', 'r')
4
list1=[]
5
list2=[]
6
longest_series=[]
7
x=0
8
current_datum=0
9
next_datum=0
10
previous_longest_series_length=0
11
current_series_length=0
12
for data in file1:
13
  a=data
14
  b=a.split(',')
15
  next_datum=float(b[1])
16
  list1.append(current_datum)
17
  if x==0:
18
    del list1[0]
19
    x=1
20
  if current_datum>=next_datum:
21
    previous_longest_series_length=int(len(longest_series))
22
    current_series_length=int(len(list1))
23
    if current_series_length>previous_longest_series_length:
24
      longest_series=list1.copy()
25
      list2=list1.copy()
26
    list1.clear()
27
  else:
28
    list2=list1.copy()
29
  second_last_datum=current_datum
30
  current_datum=next_datum
31
file1.close()
32
if current_datum>second_last_datum:
33
  list2.append(current_datum)
34
  current_series_length=int(len(list2))
35
  if current_series_length>previous_longest_series_length:
36
    longest_series=list2.copy()
37
print(longest_series, ' (', int(len(longest_series)), 'Days)' )
 

Download source code

Download data file