Lintcode 397. Longest Continuous Increasing Subsequence (Easy) (Python)

397. Longest Continuous Increasing Subsequence

Description:

Give an integer array，find the longest increasing continuous subsequence in this array.

An increasing continuous subsequence:

Can be from right to left or from left to right.
Indices of the integers in the subsequence should be continuous.
Example
For [5, 4, 2, 1, 3], the LICS is [5, 4, 2, 1], return 4.

For [5, 1, 2, 3, 4], the LICS is [1, 2, 3, 4], return 4.

Code:

class Solution:
    """
    @param A: An array of Integer
    @return: an integer
    """

    def longestIncreasingContinuousSubsequence(self, A):
        # write your code here
        if len(A) == 0:
            return 0
        l = len(A)
        cnt1, cnt2, res = 1, 1, 1
        for i in range(1,l):
            if A[i-1]<=A[i]:
                cnt1 += 1
            else:
                cnt1 = 1
            if A[i-1]>=A[i]:
                cnt2 += 1
            else:
                cnt2 = 1
            res = max(res, cnt1, cnt2)
        return res