java算法
将一个字符里出现最多的字母截取,如,addcbbs变为acs,最好能有代码! Java算法 acs
[解决办法]
先给一个算法实现如1楼所说的
计算出出现最多的字符:
public static void main(String[] args) {
String testStr = "addcbbs";
byte[] strBytes = testStr.getBytes();
for (byte b : strBytes) {
System.out.println((char)(b));
}
Map map = new HashMap();
int temp = 1;
for(int i = 0; i<strBytes.length; i++ ){
byte b = strBytes[i];
String charStr = (char)b+"";
Integer num = (Integer) map.get(charStr);
if(num != null){//不是第一次
temp = ++num;
}else{//第一次
map.put(charStr, temp);
}
if(map.containsKey(charStr)){
map.put(charStr, temp);
}
temp = 1;
}
System.out.println("-------------------");
Set key = map.keySet();
for (Iterator it = key.iterator(); it.hasNext();) {
String b = (String) it.next();
System.out.println(b+"--"+map.get(b));
}
}
import java.util.HashMap;
import java.util.Map;
public class RemoveMostWords
{
public static void main(String[] args)
{
String str = "addcbbs";
System.out.println("处理前的字符串:" + str);
String deelStr = removeMostWords(str);
System.out.println("处理后的字符串:" + deelStr);
}
private static String removeMostWords(String str)
{
if (null == str
[解决办法]
"".equals(str))
{
return str;
}
//初始化最大次数为2次
int iMax = 2;
//将所有的字符与出现的次数作为一个键值对
Map<Character, Integer> timeMap = new HashMap<Character, Integer>();
Character cTmp;
Integer iTmp;
for (int i = 0; i < str.length(); i++)
{
cTmp = str.charAt(i);
iTmp = timeMap.get(cTmp);
//首次出现的字符,不需要比较
if (null == iTmp)
{
timeMap.put(cTmp, 1);
continue;
}
//出现次数+1,放入map
iTmp = iTmp + 1;
timeMap.put(cTmp, iTmp);
//若超过最大次数,则替换最大次数
iMax = iMax < iTmp ? iTmp : iMax;
}
//将所有达到最大次数的字符替换成空
for (Map.Entry<Character, Integer> entry : timeMap.entrySet())
{
if (entry.getValue() == iMax)
{
str = str.replaceAll(String.valueOf(entry.getKey()), "");
}
}
return str;
}
}
import java.util.HashMap;
public class Test01 {
public static void main(String[] args) {
String str1 = "addcbbs";
str1 = removeMostChar(str1);
System.out.println(str1);//acs
String str2 = "abcdefabd";
str2 = removeMostChar(str2);
System.out.println(str2);//cef
String str3 = "abcdefgh";
str3 = removeMostChar(str3);
System.out.println(str3);//""
}
static String removeMostChar(String str) {
if(str == null
[解决办法]
str.equals("")) {
return str;
}
//默认出现最多次数为1
int max = 1;
HashMap<Character, Integer> map = new HashMap<>();
char[] charArr = str.toCharArray();
for (char c : charArr) {
if(map.containsKey(c)) {
//该字符存在,加1
int count = map.get(c) + 1;
map.put(c, count);
//如果字符出现次数大于max,重新设置max
if(count > max) max = count;
} else {
//添加新字符
map.put(c, 1);
}
}
//删除出现次数为max的字符
for (Character c : map.keySet()) {
if(map.get(c) == max) str = str.replaceAll(c.toString(), "");
}
return str;
}
}