refactor 34

Author: fishercoder1534

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

@@ -1,17 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 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 int[] searchRange(int[] nums, int target) {