Play-Leetcode/0896-Monotonic-Array/cpp-0896/main2.cpp at master · interview/Play-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/// Source : https://leetcode.com/problems/monotonic-array/description/
/// Author : liuyubobobo
/// Time   : 2018-09-01

#include <iostream>
#include <vector>

using namespace std;


/// One Pass
/// Time Complexity: O(n)
/// Space Complexity: O(1)
class Solution {
public:
    bool isMonotonic(vector<int>& A) {

        int trend = 0;
        for(int i = 1; i < A.size() ; i ++)
            if(trend == 0){
                if(A[i] > A[i - 1]) trend = 1;
                else if(A[i] < A[i - 1]) trend = -1;
            }
            else{
                if(A[i] > A[i - 1] && trend == -1) return false;
                else if(A[i] < A[i - 1] && trend == 1) return false;
            }

        return true;
    }
};


int main() {

    return 0;
}