hdu 1022 Train Problem I(栈)

/*
2011-9-7
author:BearFly1990
*/
package acm.hdu.tests;

import java.io.BufferedInputStream;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class HDU_1022 {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedInputStream(System.in));
List<Character> list = new LinkedList<Character>();
while(in.hasNext()){
String str="Yes.\r\n";
list.clear();
int len = in.nextInt();
char[] inS = in.next().toCharArray();
char[] outS = in.next().toCharArray();
int outPoint = 0;
for(int i = 0; i < len ; i++){
list.add(inS[i]);
str = str + "in\r\n";
int size = list.size();
if(size != 0){
while(list.get(size-1).equals(outS[outPoint])){
list.remove((Character)outS[outPoint]);
outPoint++;
str=str+"out\r\n";
size-- ;

if(size==0)
break;
}
}

}
if(list.isEmpty()){
System.out.println(str+"FINISH");
}else{
System.out.println("No.\r\nFINISH");
}

}
}
}