最长上升连续子序列

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