暴力解法
没啥好说的,暴力就完事了。
class Solution {
public int[] searchRange(int[] nums, int target) {
int []b=new int[2];
int j=0;
int i=0;
int count=0;
for(i=0;i<2;i++){
b[i]=-1;
}
for(i=0;i<nums.length; i++) {
if (nums[i] == target) {
b[j] = i;
count++;
j++;
}
if (count == 1) {
break;
}
}
if (count == 1) {
while (i <nums.length - 1 && nums[i] == nums[i + 1]) {
i++;
}
b[j] = i;
}
else
b[0] = b[1] = -1;
return b;
}
}