Monotonic Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool isMonotonic(vector<int> &nums) {
4
    auto i = find_if_not(begin(nums), end(nums), [&](int a) { return a == nums.front(); });
5
    auto j = find_if_not(rbegin(nums), rend(nums), [&](int a) { return a == nums.back(); });
6
    return is_sorted(--i, end(nums)) or is_sorted(--j, rend(nums));
7
  }
8
};