java fbi树_[蓝桥杯][算法训练VIP]FBI树-题解(Java代码)

```java

import java.util.Scanner;

import java.util.Arrays;

//借鉴 https://blog.csdn.net/liuchuo/article/details/56676987

public class Main {

public static String fbi(char[] s){

if(s.length==1){

switch(s[0]){

case '1':

System.out.print("I");

return "I";

case '0':

System.out.print("B");

return "B";

default:

break;

}

}

char[] s1 = Arrays.copyOfRange(s,0,s.length/2);

String left = fbi(s1);

char[] s2 = Arrays.copyOfRange(s,s.length/2,s.length);

String right = fbi(s2);

if(left.equals(right)){

System.out.print(left);

return left;

}else{

System.out.print("F");

return "F";

}

}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int n = sc.nextInt();

sc.nextLine();

String a = sc.next();

char[] s = a.toCharArray();

fbi(s);

}

}

```

0.0分

0 人评分