MyLeetcode/cpp_solutions/3105.cpp at main · Kaminyou/MyLeetcode · 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
class Solution {
public:
    int longestMonotonicSubarray(vector<int>& nums) {
        int res = 1;
        int cnt = 0;

        // increase
        int curr = INT_MIN;
        for (auto& num : nums) {
            if (num > curr) {
                cnt++;
                res = max(res, cnt);
            }
            else {
                cnt = 1;
            }
            curr = num;
        }

        // decrease
        curr = INT_MAX;
        cnt = 0;
        for (auto& num : nums) {
            if (num < curr) {
                cnt++;
                res = max(res, cnt);
            }
            else {
                cnt = 1;
            }
            curr = num;
        }
        return res;
    }
};