2018校招交错01串

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main{

public static void main(String[] args) {
	Scanner scanner=new Scanner(System.in);
	String string=scanner.nextLine();
	int sum=0,max=1;
	boolean flag1 = false,flag2=false;
	for (int i = 0; i < string.length()-1; i++) {
		if (string.charAt(i)=='0'&&string.charAt(i+1)=='1') {
			
			flag1=false;
			sum=2;
            if(sum>max)
					max=sum;
			for (int j = i+2; j < string.length(); j++) {
                if (flag1&&string.charAt(j)=='1') {
					sum++;
					if(sum>max)
					max=sum;
					
				}
                else if (!flag1&&string.charAt(j)=='0') {
					sum++;
					if(sum>max)
					max=sum;
					
				}else{
					
					break;
				}
                
				flag1=!flag1;
			}
		}
        if (string.charAt(i)=='1'&&string.charAt(i+1)=='0') {
			sum=2;
			if(sum>max)
					max=sum;
			flag2=false;
			for (int j = i+2; j < string.length(); j++) {
                if (flag2&&string.charAt(j)=='0') {
                	
					sum++;
					if(sum>max)
					max=sum;
				}
                else if (!flag2&&string.charAt(j)=='1') {
					sum++;
					
					if(sum>max)
					max=sum;
				}else{
					
					break;
				}
				flag2=!flag2;
			}
		}
	}
	System.out.println(max);
}

}

猜你喜欢

转载自blog.csdn.net/qq_29380377/article/details/86253466