package lianxi;
public class shuzu {
public static void main(String[] args) {
int count=0;
int max =0;
int u = 0;
int[] arr = {0,1,1,1,0,0,1,1,0,1,1,1,1};
int min = arr.length;
for(int j=0;j<arr.length;j++) {
if(1==arr[j]) {
count++;
}
if(arr[j]==0) {
if(max<count) {
max=count;
if(u<j) {
u = j;
}
}
if(min>count) {
min = count;
}
count=0;
continue;
}
}
if(count>max){
max=count;
u=arr.length-1;
}
System.out.println(“第一次出现的下标”+(u-max+1));
System.out.println(“最后一次出现的下标”+u);
System.out.println(“最大次数为:”+max);
}
}
07-08
647
10-21
131
04-15
195