Search for a Range

Given a sorted array of integers, 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 Solution {
    public int[] searchRange(int[] nums, int target) {
        int start = 0;
        int end = nums.length - 1;
        while(start <= end){
            int mid = (start + end)/2;
            if(nums[mid] > target){
                end = mid - 1;
                continue;
            }
            else if (nums[mid] < target){
                start = mid + 1;
                continue;
            }
            else {
                int[] result = new int[2];
                int i = mid;
                while(i >= 0 && nums[i] == nums[mid]){
                    i--;
                }
                
                result[0] = i + 1;
                
                i = mid;
                
                while(i < nums.length && nums[i] == nums[mid]){
                    i++;
                }
                result[1] = i - 1;
                return result;
            }
        }
        return new int[] {-1, -1};
    }
}