查找字符串中出现次数最多的字符

/** * 查找字符串中出现次数最多的字符 * @author YangHui 2009-10-14 * */ @SuppressWarnings("unchecked") public class Baidu { private static String words = "iloveyou"; private static String[] strs = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"}; private static HashMap map = null; /** * 按照26个字母,将给出的字符串中字符出现的次数统计 * @param words * @return */ public HashMap manyword(String words) { map = new HashMap(); char[] word = words.toLowerCase().toCharArray(); for (int i = 0; i < strs.length; i++) { int count = 0; for (int j = 0; j < word.length; j++) { if (strs[i].toString().equals(String.valueOf(word[j]))) { count += 1; } } map.put(strs[i].toString(), count); } return map; } /** * 根据统计好的Map数据查找出现次数最多的字符 * @param map */ public void whomanysword(HashMap map) { String maxStr = null; int max = Integer.parseInt(map.get(strs[0].toString()).toString()); for (int i = 1; i < map.size(); i++) { int word = Integer.parseInt(map.get(strs[i].toString()).toString()); if (max < word) { max = word; maxStr = strs[i].toString(); } } System.out.println(words + "中出现次数最多的字符是:【" + maxStr + "】,共出现【" + max + "】次"); } public static void main(String[] args) { Baidu bd = new Baidu(); bd.whomanysword(bd.manyword(words)); } }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值