单调数列：判断数列单调

题目

题解

class Solution {
public:
    bool isMonotonic(vector<int>& A) {
        bool flag = true;
        int index = 1;
        int n = A.size();
        while(index < n && A[index] == A[index-1])++index;
        if(index == n) return true;
        flag = A[index] > A[index-1] ? true : false;
        while(index < n){
            if(flag){
                if(A[index] < A[index - 1]) return false;
            }
            else{
                if(A[index] > A[index - 1] ) return  false;
            }
            ++index;
        }
        return true;
    }
};