問題:
給定一個整數數組(下標從 0 到 n-1, n 表示整個數組的規模),請找出該數組中的最長上升連續子序列。(最長上升連續子序列可以定義爲從右到左或從左到右的序列。)
樣例:
樣例 1:
輸入:[5, 4, 2, 1, 3] 輸出:4 解釋: 給定 [5, 4, 2, 1, 3],其最長上升連續子序列(LICS)爲 [5, 4, 2, 1],返回 4。
樣例 2:
輸入:[5, 1, 2, 3, 4] 輸出:4 解釋: 給定 [5, 1, 2, 3, 4],其最長上升連續子序列(LICS)爲 [1, 2, 3, 4],返回 4。
python:
class Solution:
"""
@param A: An array of Integer
@return: an integer
"""
def longestIncreasingContinuousSubsequence(self, A):
# write your code here
if len(A) == 0 or len(A) == 1:
return len(A)
maxLen = 1
i = 1
while i < len(A):
addLen = 1
subLen = 1
while i < len(A) and A[i] > A[i-1]:
addLen += 1
i += 1
while i < len(A) and A[i] < A[i-1]:
subLen += 1
i += 1
maxLen = max(maxLen, max(addLen, subLen))
return maxLen
C++:
class Solution {
public:
/**
* @param A: An array of Integer
* @return: an integer
*/
int longestIncreasingContinuousSubsequence(vector<int> &A) {
// write your code here
if(A.size() == 0 || A.size() == 1)
{
return A.size();
}
int maxLen = 1;
int i = 1;
while(i < A.size())
{
int AddLen = 1;
int SubLen = 1;
while(i < A.size() && A[i] > A[i-1])
{
AddLen++;
i++;
}
while(i < A.size() && A[i] < A[i-1])
{
SubLen++;
i++;
}
maxLen = max(maxLen, max(AddLen, SubLen));
}
return maxLen;
}
};