java华为od机试 寻找字母开头或者结尾，其他字符为数字的字符串最大长度

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;

// afv1234ad  4
public class Main10 {
    
    
    public static void main(String[] args) throws IOException {
    
    
        BufferedReader buff = new BufferedReader(new InputStreamReader(System.in));
        String first;
        while (null!=(first=buff.readLine())){
    
    
            String s = first.replaceAll("[a-zA-Z]", "");
            String s2 = first.replaceAll("\\d", "");
            if (s.length()==0||s2.length()==0) System.out.println(-1);
            String s1 = first.replaceAll("[a-zA-Z](\\d*)", "");
            StringBuilder str = new StringBuilder();
            String s3 = first.replaceAll("\\d", "-");
            String s4 = s3.replaceAll("[a-zA-Z]+", "a");


            char[] chars = s4.toCharArray();
            int start=0,end=0;
            boolean a1=true;
            boolean a2=true;
            ArrayList<Integer> list = new ArrayList<>();
            int len =chars.length;
            for (int j=0;j<len;j++){
    
    
                if (chars[j]=='a') {
    
    
                    start=j;
                    if(j+1<=len){
    
    
                        for (int k=j+1;k<chars.length;k++){
    
    
                            if(k==len-1&&chars[k]=='-'){
    
    
                                end=k;
                                list.add(end-start+1);
                                break;
                            }
                            if(chars[k]=='a'||k==len-1) {
    
    
                                end=k;
                                list.add(end-start);
                                break;
                            }
                        }
                    }
                }
            }
            for (int j=len-1;j>0;j--){
    
    
                char tmp=chars[j];
                if (tmp=='a') {
    
    
                    end=j;
                    if(j-1>=0){
    
    
                        for (int k=j-1;k>=0;k--){
    
    
                            if(k==0 && chars[k]=='-'){
    
    
                                start=k;
                                list.add(end-start+1);
                                break;
                            }
                            if(chars[k]=='a' ) {
    
    
                                start=k;
                                list.add(end-start);
                                break;
                            }
                        }
                    }
                }
            }
            Collections.sort(list);
            Collections.reverse(list);
            System.out.println(list);
            System.out.println(list.get(0));

        }
    }
}