给定一个整数数组(下标从 0 到 n-1, n 表示整个数组的规模),请找出该数组中的最长上升连续子序列。(最长上升连续子序列可以定义为从右到左或从左到右的序列。)
样例
给定 [5, 4, 2, 1, 3]
, 其最长上升连续子序列(LICS)为 [5, 4, 2, 1]
, 返回 4
.
给定 [5, 1, 2, 3, 4]
, 其最长上升连续子序列(LICS)为 [1, 2, 3, 4]
, 返回 4
.
class Solution {
public:
/**
* @param A an array of Integer
* @return an integer
*/
int longestIncreasingContinuousSubsequence(vector<int>& A) {
// Write your code here
int n = A.size();
if (n <= 1)
{
return n;
}
int len1[n];
int len2[n];
len1[0] = 1;
len2[0] = 1;
int result = 1;
for (int i = 1; i < n; i++)
{
len1[i] = 1;
len2[i] = 1;
if (A[i] > A[i-1])
{
if (len1[i-1]+1 > len1[i])
{
len1[i] = len1[i-1] + 1;
}
}
else
{
if (len2[i-1]+1 > len2[i])
{
len2[i] = len2[i-1] + 1;
}
}
if (len1[i] > result)
{
result = len1[i];
}
if (len2[i] > result)
{
result = len2[i];
}
}
return result;
}
};