试题 历届试题 拉马车

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String PA=sc.next();
String PB=sc.next();
Queue<Character> A=new LinkedList<Character>();
char[] charArrayA=PA.toCharArray();
for(char c:charArrayA){
A.offer(c);
}
Queue<Character> B=new LinkedList<Character>();
char[] charArrayB=PB.toCharArray();
for(char c:charArrayB){
B.offer(c);
}
Stack<Character> dast=new Stack<Character>();
boolean flag=true;
while(true){
if(flag){
Character Aout=A.poll();
int indeOf=dest.indextOf(Aout);
if(indexOf!=-1){
desk.push(Aout);
 int deskleng=desk.size();
 for(int i=indexOf;i<deskleng;i++){
 Character win=desk.pop();
 A.offer(win);
 }
 }else{
 desk.push(Aout);
 flag=false;
 }
 if(A.size()==0){
 for(char c:B){
 System.out.print(C);
 }
 break;
 }
 }
 if(!flag){
 Character Bout=B.poll();
 int indexOf=desk.indexOf(Bout);
 if(indexOf!=-1){
 dest.push(Bout);
 int deskleng=desk.size();
 for(int i=indexOf;i<deskleng;i++){
 Character win=desk.pop();
 B.offer(win);
 }
 }
 else{
 desk.push(Bout);
 flag=true;
 }
 if(B.size()==0){
 for(char c:A){
 System.out.print(c);
 }
 break;
 }
 }
 }
 }
 }