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].
func searchRange(nums []int, target int) []int {
var ret[]int=make([]int,2)
ret[0]=-1
ret[1]=-1
length:=len(nums)
if length==0{
ret[0]=-1
ret[1]=-1
return ret
}
if length==1{
if target==nums[0]{
ret[0]=0
ret[1]=0
}
return ret
}
if length%2==0{
if target==nums[length/2-1]{
for i:=length/2-1;i>=0;i--{
if nums[i]==target{
ret[0]=i
}else {
break
}
}
for i:=length/2-1;i<len(nums);i++{
if nums[i]==target {
ret[1]=i
}else {
break
}
}
}else if target==nums[length/2]{
for i:=length/2;i>=0;i--{
if nums[i]==target{
ret[0]=i
}else {
break
}
}
for i:=length/2;i<len(nums);i++{
if nums[i]==target {
ret[1]=i
}
}
}else if target<nums[length/2-1]&&target>=nums[0]{
tmp:= searchRange(nums[0:length/2-1],target)
if tmp[0]==-1{
ret[0]=-1
ret[1]=-1
return ret
}else {
ret=tmp
}
}else if target>nums[length/2]&&target<=nums[len(nums)-1]{
if length/2+1<len(nums){
tmp:= searchRange(nums[length/2+1:],target)
if tmp[0]==-1{
ret[0]=-1
ret[1]=-1
return ret
}else{
ret[0]=tmp[0]+length/2+1
ret[1]=tmp[1]+length/2+1
}
}
}
}else {
if nums[length/2]==target{
for i:=length/2;i>=0;i--{
if nums[i]==target{
ret[0]=i
}else {
break
}
}
for i:=length/2;i<len(nums);i++{
if nums[i]==target {
ret[1]=i
}else {
break
}
}
}else if target<nums[length/2]&&target>=nums[0]{
tmp:=searchRange(nums[0:length/2],target)
if tmp[0]==-1{
ret[0]=-1
ret[1]=-1
return ret}else {
ret=tmp
}
}else if target>nums[length/2]&&target<=nums[len(nums)-1]{
tmp:=searchRange(nums[length/2+1:],target)
if tmp[0]==-1{
ret[0]=-1
ret[1]=-1
return ret}
ret[0]=length/2+1+tmp[0]
ret[1]=length/2+1+tmp[1]
}
}
return ret
}