Improved task 34.

Author: javadev

src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java

@@ -2,13 +2,10 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
 // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5
-// #2022_02_18_Time_1_ms_(30.87%)_Space_47.1_MB_(20.91%)
+// #2022_04_30_Time_0_ms_(100.00%)_Space_45.7_MB_(81.00%)
 
-@SuppressWarnings("unused")
 public class Solution {
     public int[] searchRange(int[] nums, int target) {
-        int l = 0;
-        int r = nums.length - 1;
         int[] ans = new int[2];
         ans[0] = helper(nums, target, false);
         ans[1] = helper(nums, target, true);
@@ -24,14 +21,12 @@ private int helper(int[] nums, int target, boolean equals) {
             if (nums[mid] == target) {
                 result = mid;
             }
-
             if (nums[mid] < target || (nums[mid] == target && equals)) {
                 l = mid + 1;
             } else {
                 r = mid - 1;
             }
         }
-
         return result;
     }
 }

src/test/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/SolutionTest.java

@@ -12,4 +12,18 @@ void searchRange() {
         int[] actual = new Solution().searchRange(new int[] {5, 7, 7, 8, 8, 10}, 8);
         assertThat(actual, equalTo(expected));
     }
+
+    @Test
+    void searchRange2() {
+        int[] expected = new int[] {-1, -1};
+        int[] actual = new Solution().searchRange(new int[] {5, 7, 7, 8, 8, 10}, 6);
+        assertThat(actual, equalTo(expected));
+    }
+
+    @Test
+    void searchRange3() {
+        int[] expected = new int[] {-1, -1};
+        int[] actual = new Solution().searchRange(new int[] {}, 0);
+        assertThat(actual, equalTo(expected));
+    }
 }