Count Elements With Strictly Smaller and Greater Elements LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countElements(vector<int> &nums) {
4
    int M = *max_element(nums.begin(), nums.end());
5
    int m = *min_element(nums.begin(), nums.end());
6
    int res = 0;
7
    for (int i = 0; i < nums.size(); i++) {
8
      if (nums[i] > m && nums[i] < M) res++;
9
    }
10
    return res;
11
  }
12
};