func searchRange(nums []int, target int) []int {
    if len(nums) == 0 {
        return []int{-1,-1}
    }
    if len(nums) == 1 {
        if nums[0] == target {
            return []int{0,0}
        }
        return []int{-1,-1}
    }
    start := nums[0]
    end := nums[len(nums) - 1]
    if target < start {
        return []int{-1,-1}
    } else if target > end {
        return []int{-1,-1}
    }
    midIndex := len(nums) / 2
    middle := nums[midIndex]
    if middle < target {
        res := searchRange(nums[midIndex:], target)
        if res[0] == -1 {
            return res
        }
        return []int{res[0] + midIndex, res[1] + midIndex}
    } else if middle > target {
        res := searchRange(nums[:midIndex], target)
        return res
    } else {
        l := searchRange(nums[:midIndex], target)
        r := searchRange(nums[midIndex:], target)
        if l[0] == -1 {
            return []int{r[0] + midIndex, r[1] + midIndex}
        } else {
            return []int{l[0], r[1] + midIndex}
        }
    }
}