一开始写错了
代码如下
class Solution {
public int[] searchRange(int[] nums, int target) {
int[] result = new int[]{-1,-1};
if(nums == null || nums.length==0){
return result;
}
boolean flag = false;
for(int i = 0; i < nums.length; i++){
int current = nums[i];
if(current == target && !flag){
result[0] = i;
flag = true;
}
if(current != target && flag){
result[1] = i - 1;
break;
}
}
return result;
}
}
后来发现有一个细节处理有误
/**
* Created by zhangwd4 on 2017/11/28.
*/
public class LeetCode34 {
public int[] searchRange(int[] nums, int target) {
int[] result = new int[]{-1,-1};
if(nums == null || nums.length==0){
return result;
}
boolean flag = false;
for(int i = 0; i < nums.length; i++){
int current = nums[i];
if(current == target && !flag){
result[0] = i;
flag = true;
}
if(current != target && flag){
result[1] = i - 1;
break;
}
if(nums[nums.length -1] == target)
result[1] = nums.length -1;
}
return result;
}
public static void main(String[] args){
int[] ints = new int[]{1};
int[] result = new LeetCode34().searchRange(ints,1);
for(int i :result)
System.out.println(i);
}
}