Skip to content

Najdłuższy spójny podciąg rosnący

🔗 Opis problemu

Implementation

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
function longestGrowingSubstring(array)
    maxLength = 1
    currentLength = 1

    for i in 2:length(array)
        if array[i] > array[i - 1]
            currentLength += 1
            maxLength = max(maxLength, currentLength)
        else
            currentLength = 1
        end
    end

    return maxLength
end

array = [4, 9, 7, 2, 4, 7, 9, 3, 8, 6]

println(longestGrowingSubstring(array))