Improved task 2148.

Author: javadev

src/main/java/g2101_2200/s2148_count_elements_with_strictly_smaller_and_greater_elements/Solution.java

@@ -3,29 +3,25 @@
 // #Easy #Array #Sorting #2022_06_07_Time_0_ms_(100.00%)_Space_40.6_MB_(88.75%)
 
 public class Solution {
- public int countElements(int[] a) {
- int min = a[0];
- int max = a[0];
+ public int countElements(int[] nums) {
+ int min = nums[0];
+ int max = nums[0];
  int minocr = 1;
  int maxocr = 1;
- for (int i = 1; i < a.length; ++i) {
- {
- if (a[i] < min) {
- min = a[i];
- minocr = 1;
- } else if (a[i] == min) {
- minocr++;
- }
+ for (int i = 1; i < nums.length; ++i) {
+ if (nums[i] < min) {
+ min = nums[i];
+ minocr = 1;
+ } else if (nums[i] == min) {
+ minocr++;
  }
- {
- if (a[i] > max) {
- max = a[i];
- maxocr = 1;
- } else if (a[i] == max) {
- maxocr++;
- }
+ if (nums[i] > max) {
+ max = nums[i];
+ maxocr = 1;
+ } else if (nums[i] == max) {
+ maxocr++;
  }
  }
- return (min == max) ? 0 : a.length - minocr - maxocr;
+ return min == max ? 0 : nums.length - minocr - maxocr;
  }
 }

src/test/java/g2101_2200/s2148_count_elements_with_strictly_smaller_and_greater_elements/SolutionTest.java

@@ -15,4 +15,9 @@ void countElements() {
  void countElements2() {
  assertThat(new Solution().countElements(new int[] {-3, 3, 3, 90}), equalTo(2));
  }
+
+ @Test
+ void countElements3() {
+ assertThat(new Solution().countElements(new int[] {-71, -71, 93, -71, 40}), equalTo(1));
+ }
 }