答题奖4技术分(需完整代码) ！终于给整出来了！ - 黑马程序员技术交流社区

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Map.Entry;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class MixSortStr {
public static void main(String[] args) {
StringBuilder str1 = new StringBuilder("sdfg,hellozx,sdfcv-waadfa,fsasdfxcvdf");// 已有字符串
Scanner scan = new Scanner(System.in);
System.out.println("请输入任意字符串：");
String str2 = scan.nextLine();
String sub = getMixString(str1.toString(),str2);//最大的交集字符串
int start = str1.indexOf(sub);//sub在str1中第一次出现的位置
int end = start + sub.length();
str1 = str1.delete(start,end);//str1中去掉str2中最大的交集字符串
TreeMap treeMap = finder(str1);
ArrayList<Map.Entry<String, Integer>> arl = new ArrayList<Map.Entry<String, Integer>>(treeMap.entrySet());
Collections.sort(arl,new Comparator<Map.Entry<String, Integer>>() {
public int compare(Entry<String, Integer> o1, Entry<String, Integer> o2) {
int num = o1.getValue().compareTo(o2.getValue());
if(num == 0){
num = o2.getKey().compareTo(o1.getKey());
}
return num;
}
});
for(Map.Entry<String, Integer> entry : arl) {
String key = entry.getKey().toString();
int count = entry.getValue();
System.out.print(key + "(出现"+count+"次)");
}
}
/**
* 功能：获取两个字符串的最大交集字符串(可能是多个相同长度的字符串)
* @param:max(长的字符串)
* @param:min(短的字符串)
* @param;sub(截取的字符串)
* */
private static String getMixString(String str1, String str2) {
String max = (str1.length() > str2.length() ? str1 : str2);
String min = max.equals(str1) ? str2 : str1;
for (int i = 0; i < min.length(); i++) {
for (int start = 0, end = min.length() - i; end != min.length() + 1; start++, end++) {
String sub = min.substring(start, end);
if (max.contains(sub))
return sub;
}
}
return null;
}
/**功能：统计字符出现次数
* @param myTreeMap:存放字符串统计后的结果
* @param regex：匹配的正则表达式
* @param
* */
public static TreeMap<Object, Integer> finder(StringBuilder source) {
TreeMap<Object, Integer> myTreeMap = new TreeMap<Object, Integer>();//存放统计结果后的容器
String regex = "[a-zA-Z]+";//匹配的正则表达式
Object word = null,num = null;
Integer count;//计数器
StringBuilder regexNew = new StringBuilder();
char[] ch = source.toString().toCharArray();
for(int i = 0; i < ch.length; i++){
regexNew.setLength(0);
regexNew.append(ch<i>);
if (regexNew != null && !regexNew.equals("")) {
regex = regexNew.toString();
}
Matcher matcher = Pattern.compile(regex).matcher(source);
while (matcher.find()) {
word = matcher.group();
if (myTreeMap.containsKey(word)) {
num = myTreeMap.get(word);
count = (Integer) num + 1;
} else
count = new Integer(1);
myTreeMap.put(word, count);
}
count = null;
}
return myTreeMap;
}
}

复制代码