[Leetcode] 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[] result = new int[]{-1, -1};
        if(nums == null){
            return result;
        }
        int start = 0;
        int end = nums.length - 1;
        while(start <= end) {
            int mid = (start + end)/2;
            if(nums[mid] == target) {
                return findRange(nums, mid);
            }
            else if(nums[mid] > target) {
                end = mid - 1;
            }
            else if(nums[mid] < target) {
                start = mid + 1;
            }
        }
        return result;
    }
    
    private int[] findRange(int[] nums, int n) {
        int start = n;
        int end = n;
        while(nums[start] == nums[n]){
            start--;
            if(start == -1) {
                break;
            }
        }
        while(nums[end] == nums[n]) {
            end++;
            if(end == nums.length) {
                break;
            }
        }
        return new int[]{start+1, end-1};
    }
}