fd

Author: dingjikerbo

solution/src/main/java/com/inuker/solution/SearchForARange.java

@@ -6,7 +6,41 @@
 
 public class SearchForARange {
 
+    /**
+     * TestCase
+     * [1], 0
+     * [1], 1
+     */
     public int[] searchRange(int[] nums, int target) {
+        if (nums.length == 0) {
+            return new int[]{-1, -1};
+        }
+        int first = firstHigherEqual(nums, target);
+        if (first == nums.length || nums[first] != target) {
+            return new int[] {
+                    -1, -1
+            };
+        }
+        return new int[] {
+                first,
+                firstHigherEqual(nums, target + 1) - 1
+        };
+    }
+
+    private int firstHigherEqual(int[] nums, int target) {
+        int left = 0, right = nums.length;
+        while (left < right) {
+            int mid = (left + right) / 2;
+            if (nums[mid] < target) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return left;
+    }
+
+    public int[] searchRange2(int[] nums, int target) {
         if (nums.length == 0) {
             return new int[]{-1, -1};
         }

test/src/main/java/com/inuker/test/main.java

@@ -1,5 +1,6 @@
 package com.inuker.test;
 
+import com.inuker.solution.SearchForARange;
 import com.leetcode.library.ListNode;
 import com.leetcode.library.RandomListNode;
 import com.leetcode.library.TreeNode;
@@ -27,5 +28,11 @@
 public class main {
 
     public static void main(String[] args) {
+        int[] range = new SearchForARange().searchRange(new int[] {
+                1, 2, 3, 3, 4
+        }, 3);
+        for (int n : range) {
+            System.out.print(n + " ");
+        }
     }
 }