力扣941有效的山脉数组

class Solution {
    public boolean validMountainArray(int[] A) {
        boolean up = false;//是否在下降前上升了
        boolean down = false;//是否在上升后下降了

        int index = 1;
        if(A == null || A.length < 3)
            return false;
        int t = A[0];//t为A[index]前一个值；
        while(index < A.length){
            if(A[index] > t){
                if(down == false)
                    up = true;
                else return false;
            }
            else if(A[index] < t ){
                if(up == true)
                    down = true;
                else return false;
            }
            else return false;
            t = A[index];
            index++;
        }
        if(up == true && down == true){
            return true;
        }
        else return false;
    }
}