public class Solution {
/**
* @param A an array of Integer
* @return an integer
*/
public int longestIncreasingContinuousSubsequence(int[] A) {
// Write your code here
if(null==A||0==A.length){
return 0;
}
if(1==A.length) return 1;
int max = 1;
int count = 1;
if(A[1]>A[0]){
count++;
if(count>max) {
max = count;
}
}else if(A[1]<A[0]){
count++;
if(count>max) {
max = count;
}
}else{
count =1;
}
for(int i=2;i<A.length;i++){
if(A[i]>A[i-1]&&A[i-1]>A[i-2]){
count++;
if(count>max) {
max = count;
}
}else if(A[i]<A[i-1]&&A[i-1]<A[i-2]){
count++;
if(count>max) {
max = count;
}
}else{
count = 2;
}
}