思路很简单,得用到队列(因为先进先出原则),到A走时先判断其队列是否为空,空则A胜利,否则A队列出一个元素,依次判断即可。
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(sc.hasNext()) {
int n = sc.nextInt();
for (int i = 0; i < n; i++) { //测试用例
String s = sc.next();
char[] ch = s.toCharArray();
int flag = 0; //标志是谁先走,flag == 0 则 Alice先走
char a = 'a';
char z = 'z';
for (int j = 0; j < s.length(); j++) {
if(flag == 0){ //Alice走
if(ch[j] == a){
ch[j] = 'b';
}else{
ch[j] = a;
}
flag = 1;
}else //Bob走
{
if(ch[j] == z){
ch[j] = 'y';
}else{
ch[j] = z;
}
flag = 0;
}
}
for (int j = 0; j < s.length(); j++) {
System.out.print(ch[j]);
}
System.out.println();
}
}
}
}