1.统计两个字符串中个字符的个数
2.分别计算满足每个条件所需要的最小操作数
2.1 统计a串和b串转换成同一字符所需的最小操作数,
2.2统计a<b和b<a所需要的最小操作次数
public int minCharacters(String a, String b) {
int[] va = new int[26];
int[] vb = new int[26];
int alen = a.length(),blen = b.length();
for (char item:a.toCharArray()) va[item-'a']++;
for (char item:b.toCharArray()) vb[item-'a']++;
//1.计算都转换成同一个字符的最小操作次数,(直接枚举)
int ret = Integer.MAX_VALUE,sum = a.length()+b.length();
for (int i=0;i<26;i++){
ret = Math.min(ret,sum-va[i]-vb[i]);
}
//2.计算a<b,或b<a的最小操作次数,也是枚举
int acount = 0,bcount = 0;
for (int i=0;i<25;i++){
//2.1计算a<b
acount += va[i];
bcount += vb[i];
ret = Math.min(ret,alen-acount+bcount);
ret = Math.min(ret,blen-bcount+acount);
}
return ret;
}