longest increasing continuous subsequence

public int (int[] A) {
    
    if (A == null || A.length == 0)
        return 0;
    int max = 1, continuous = 1;
    for (int i = 1; i < A.length; ++i) {
        if (A[i] > A[i - 1]) {
            continuous += 1;
            max = Math.max(continuous, max);
        } else {
            continuous = 1;
        }
    }
    continuous = 1;
    for (int i = A.length - 1; i >= 1; --i) {
        if (A[i - 1] > A[i]) {
            continuous += 1;
            max = Math.max(continuous, max);
        } else {
            continuous = 1;
        }
    }
    return max;
}

private int max = 0;

public int longestIncreasingContinuousSubsequenceII(int[][] A) {
    
    if (A == null || A.length == 0 || A[0].length == 0)
        return 0;
    int[][] dp = new int[A.length][A[0].length];
    for (int i = 0; i < A.length; ++i) {
        for (int j = 0; j < A[0].length; ++j) {
            if (dp[i][j] != 0)
                continue;
            dfs(A, dp, i, j);
        }
    }
    return max;
}

public int dfs(int[][] nums, int[][] dp, int i, int j) {
    if (dp[i][j] > 0)
        return dp[i][j];
    int val = nums[i][j];
    int[] vals = new int[4];
    if (j - 1 >= 0 && nums[i][j - 1] > val)
        vals[0] = dfs(nums, dp, i, j - 1);
    if (j + 1 < nums[0].length && nums[i][j + 1] > val)
        vals[1] = dfs(nums, dp, i, j + 1);
    if (i - 1 >= 0 && nums[i - 1][j] > val)
        vals[2] = dfs(nums, dp, i - 1, j);
    if (i + 1 < nums.length && nums[i + 1][j] > val)
        vals[3] = dfs(nums, dp, i + 1, j);
    dp[i][j] = 1 + Math.max(vals[0], Math.max(vals[1], Math.max(vals[2], vals[3])));
    max = Math.max(dp[i][j], max);
    return dp[i][j];
}