约德尔算法

package 基础题;

import java.util.Scanner;

/**
 * @author zx天才
 * @version 2020年9月11日
 * @paramYueDeEr.java
 * @Description:
 */

public class Main {
	public static void main(String[] args) {
		 Scanner in = new Scanner(System.in);
		
		String str = in.next();
		String str1 = in.next();
		String c = "";
		int b = 0;
		
		char[] arrays = str.toCharArray();
		char[] numTurn = new char[str.length()];
		
		//对字符串进行转化,得到01字符串
		for (int i = 0; i < arrays.length; i++) {
			if (arrays[i] >= 'A' && arrays[i] <= 'Z' || arrays[i] >= 'a' && arrays[i] <= 'z' || arrays[i] >= '0' && arrays[i] <= '9') {
				 c =  c+"1";
			}
			else {
				 c =  c+"0";
			}
		}
		//与已经输入的01字符串进行比较
		for (int i = 0; i < numTurn.length; i++) {
			if (c.charAt(i)==str1.charAt(i)) {
				b++;
			}
			
		}
		double d =(double)b/arrays.length;
		

		System.out.printf("%.7f%%",d*100);
		
		in.close();
	}
}

利用字符串的比较完成这算法。