hdu5842-Lweb and String-续缘之路

import java.io.*;
import java.util.*;
import java.util.concurrent.LinkedBlockingQueue;
public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		sc.nextLine();
		for(int o=1;o<=n;o++){
			String cur=sc.nextLine();
			int l=cur.length();
			int max=-1;
			for(int i='A';i<='C';i++){
				for(int j=0;j<l+1;j++){
					StringBuilder sb=new StringBuilder(cur).insert(j, (char)i);
					int k=0;
					while(judge(sb.toString())){
						int q=sb.length();
						sb=delete(sb);
						k+=q-sb.length();
						}
				max=Math.max(max,k);
				}
			}
			System.out.println(max);
		}

	}
	public static boolean judge(String s){
		if(s.contains("AA")||s.contains("BB")||s.contains("CC"))
			return true;
		else
			return false;
	}
	public static StringBuilder delete(StringBuilder sb){
		char temp=sb.charAt(0);
		int js=1;
		Queue<Integer>queue=new LinkedBlockingQueue<Integer>();
		sb.append("D");
		for(int i=1;i<sb.length();i++){
			if(sb.charAt(i)!=temp){
				if(js==1){
					queue.add(i-1);
				}
				else{
					js=1;
				}
				temp=sb.charAt(i);
			}
			else{
				js++;
			}
		}
		String cons=new String();
		for(int i:queue){
			cons=cons+sb.charAt(i);
		}
		return new StringBuilder(cons);
	}
}