Added test

Author: javadev

src/main/java/g3501_3600/s3510_minimum_pair_removal_to_sort_array_ii/Solution.java

@@ -98,6 +98,9 @@ private int getRes(
     }
 
     private void modify(long[] segment, int idx, long num) {
+        if (segment[idx] == num) {
+            return;
+        }
         segment[idx] = num;
         while (idx != 0) {
             idx = (idx - 1) / 2;

src/test/java/g3501_3600/s3510_minimum_pair_removal_to_sort_array_ii/SolutionTest.java

@@ -27,4 +27,9 @@ void minimumPairRemoval4() {
                 new Solution().minimumPairRemoval(new int[] {2, 2, -1, 3, -2, 2, 1, 1, 1, 0, -1}),
                 equalTo(9));
     }
+
+    @Test
+    void minimumPairRemoval5() {
+        assertThat(new Solution().minimumPairRemoval(new int[] {5}), equalTo(0));
+    }
 }