算法竞赛入门经典java版程序ch3 Uva10340

package ch3.uva10340;

import java.util.*;

//UVa10340
class Main {	
	public static void main(String[] args) {
		String a,b;
		Scanner cin = new Scanner(System.in);		
		while (cin.hasNext()) {
			a= cin.next();
			b=cin.next();
			//System.out.printf("%s,%s",a,b);
			char[] bArr=b.toCharArray();
			String c="";
			int index=0;
			boolean isNo=false;
			for(int i=0;i<a.length();i++){
				int j;
				for(j=index;j<b.length();j++){
					if(a.charAt(i)==bArr[j]){
						c=c+bArr[j];//可以不需要
						index=j+1;//下次从index后面开始找
						break;
					}
				}
				if(j>=b.length()){//只要有一个没找到
					System.out.printf("No\n");
					isNo=true;
					break;
				}
			}			
			//System.out.println("c ="+c);
			if(!isNo)
				System.out.printf("Yes\n");
		}
	}
}

/*


 */