京东2019实习生测开方向的笔试程序代码

给一个01序列，找出该序列中连续为1的最大长度（序列可以从后向前重新组合） -----（具体的问题忘了，看下面例子）：

输入：11011

输出：4

分析：将该序列经过重新有规律的组合可以变成11110，所以连续为1的最大长度为4.

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.next();
        int len = str.length();
        int result = solution(str);
        System.out.println(result);
    }

    public static int solution(String str){
        int len = str.length();
        String[] finalStr = reverse(str,len);
        int max = oneCountsInString(finalStr[0],len);
        for(int i=1; i<len; i++){
            if(oneCountsInString(finalStr[i],len) > max ){
                max = oneCountsInString(finalStr[i],len);
            }
        }
        return max;
    }

    public static int oneCountsInString(String str, int len){
        int count = len;
        char[] char1 = new char[len];
        for(int i=0; i<len; i++){
            char1[i] = '1';
        }
        if(str.contains(new String(char1))){
            return count;
        }else {
            return oneCountsInString(str,len-1);
        }
    }
    public static String[] reverse(String str,int len){
        String[] subPre = new String[len];
        String[] subLast = new String[len];
        String[] finalStr = new String[len];
        for(int i=0; i<len; i++){
            subPre[i] = str.substring(len-i-1,len);
            subLast[i] = str.substring(0,len-1-i);
            finalStr[i] = subPre[i]+subLast[i];
        }
        return finalStr;
    }
}