[N-0] refactor 34

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_34.java

@@ -1,25 +1,28 @@
 package com.fishercoder.solutions;
 
-import com.fishercoder.common.utils.CommonUtils;
-
-/**Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.
-
- Your algorithm's runtime complexity must be in the order of O(log n).
-
- If the target is not found in the array, return [-1, -1].
+/**
+ * 34. Search for a Range
+ *
+ * Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.
+ * Your algorithm's runtime complexity must be in the order of O(log n).
+ * If the target is not found in the array, return [-1, -1].
 
  For example,
  Given [5, 7, 7, 8, 8, 10] and target value 8,
  return [3, 4].
+
  */
 public class _34 {
 
-    public static int[] searchRange(int[] nums, int target) {
-        int start = 0;
-        int end = nums.length - 1;
+    public int[] searchRange(int[] nums, int target) {
         int[] range = new int[2];
         range[0] = -1;
         range[1] = -1;
+        if (nums == null || nums.length == 0) {
+            return range;
+        }
+        int start = 0;
+        int end = nums.length - 1;
         while (start + 1 < end) {
             int mid = start + (end - start) / 2;
             if (nums[mid] == target) {
@@ -40,14 +43,14 @@ public static int[] searchRange(int[] nums, int target) {
                 end = mid;
             }
         }
+
         if (nums[start] == target) {
             range[0] = start;
             while (start + 1 < nums.length && nums[start] == nums[start + 1]) {
                 start++;
             }
             range[1] = start;
-        }
-        if (nums[end] == target) {
+        } else if (nums[end] == target) {
             range[1] = end;
             while (end - 1 >= 0 && nums[end] == nums[end - 1]) {
                 end--;
@@ -56,11 +59,4 @@ public static int[] searchRange(int[] nums, int target) {
         }
         return range;
     }
-
-    public static void main(String... strings) {
-        int[] nums = new int[]{1, 2, 3};
-        int target = 2;
-        int[] result = searchRange(nums, target);
-        CommonUtils.printArray(result);
-    }
 }

src/test/java/com/fishercoder/_34Test.java

@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._34;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _34Test {
+    private static _34 test;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        test = new _34();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 2, 3};
+        assertArrayEquals(new int[]{1, 1}, test.searchRange(nums, 2));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{};
+        assertArrayEquals(new int[]{-1, -1}, test.searchRange(nums, 0));
+    }
+}