2148. Count Elements With Strictly Smaller and Greater Elements

Given an integer array nums, return the number of elements that have both a strictly smaller and a strictly greater element appear in nums.

 

Example 1:

Input: nums = [11,7,2,15]
Output: 2
Explanation: The element 7 has the element 2 strictly smaller than it and the element 11 strictly greater than it.
Element 11 has element 7 strictly smaller than it and element 15 strictly greater than it.
In total there are 2 elements having both a strictly smaller and a strictly greater element appear in nums.

Example 2:

Input: nums = [-3,3,3,90]
Output: 2
Explanation: The element 3 has the element -3 strictly smaller than it and the element 90 strictly greater than it.
Since there are two elements with the value 3, in total there are 2 elements having both a strictly smaller and a strictly greater element appear in nums.

 

Constraints:

  • 1 <= nums.length <= 100
  • -105 <= nums[i] <= 105

2148. Count Elements With Strictly Smaller and Greater Elements
struct Solution;

impl Solution {
    fn count_elements(nums: Vec<i32>) -> i32 {
        let n = nums.len();
        let min = *nums.iter().min().unwrap();
        let max = *nums.iter().max().unwrap();
        if min == max {
            return 0;
        }
        let mut count = 0;
        for i in 0..n {
            if nums[i] == min || nums[i] == max {
                count += 1;
            }
        }
        (n - count) as i32
    }
}

#[test]
fn test() {
    let nums = vec![11, 7, 2, 15];
    let res = 2;
    assert_eq!(Solution::count_elements(nums), res);
    let nums = vec![-3, 3, 3, 90];
    let res = 2;
    assert_eq!(Solution::count_elements(nums), res);
}