https://leetcode.com/problems/monotonic-array/
class Solution {
public:
bool isMonotonic(vector<int>& A) {
if(A.size()==1) return true;
bool increase = false, decrease = false;
for(int i=1;i<A.size();i++){
if(A[i]>A[i-1]){
increase = true;
}
else if(A[i]<A[i-1]){
decrease = true;
}
}
return !(increase&decrease);
}
};