【Leetcode_easy】896. Monotonic Array

problem

896. Monotonic Array

solution1:

class Solution {
public:
    bool isMonotonic(vector<int>& A) {
        int inc = true, dec = true;
        for(int i=; i<A.size(); ++i)
        {
            inc &= (A[i]>=A[i-]);
            dec &= (A[i]<=A[i-]);
        }
        return inc || dec;
    }
};

solution2:

class Solution {
public:
    bool isMonotonic(vector<int>& A) {
        int inc = false, dec = false;
        for(int i=; i<A.size(); ++i)
        {
            if(A[i]>A[i-]) inc = true;
            if(A[i]<A[i-]) dec = true;
            if(inc && dec) return false;
        }
        return true;
    }
};

参考

1. Leetcode_easy_896. Monotonic Array;

2. discuss1;

3. discuss2;

完