求一个字符串中出现次数最多的字符的高效算法

最新推荐文章于 2025-05-19 09:31:57 发布

原创最新推荐文章于 2025-05-19 09:31:57 发布 · 1.5k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法

算法专栏收录该内容

20 篇文章

订阅专栏

本文提供了一个Java程序示例，该程序用于找出给定字符串中出现次数最多的字符及其出现次数。通过对字符串进行迭代并使用整型数组记录每个字符的出现频率来实现。

/** * 求一个字符串中出现次数最多次数的字符 * @author 懒人-小何 * */ public class StringTest { public static void main(String[] args) { int[] num = new int[123]; //用来记录每个字符出现的次数 String str = "abzbbzcczzzwwaaasazzasdafccsddvvvbbbdaiizolyyqppachhcushuihyqppachhcushuihyqppachhcushuihyqppachhcushuih" + "yqppachhcushuihyqppachhcushuihyqppachhcushuihyqppachhcushuihyqppachhcushuih" + "yqppachhcushuihyqppachhcushuihyqppachhcushuihyqppachhcushuihyqppachhcushuih" + "yqppachhcushuihyqppachhcushuihyqppachhcushuih" + "yqppachhcushuih" + "yqppachhcushuih" + "afasfsafasfdfaaloxhhhoxpppqpzzyyvnammdmdmdmmamdmamdamdmdmdmmamdmamdamdmdmdmmamdmamdamdmdmdmmamdmamdamd" + "mdmdmmamdhhhhhhhhhhhhhhhhhhhhhhhhmamdamd" + "mdmdmmamdmahhhhhhhhhhhhhhhhhhhhhhmdamd" + "uayytzcwqaoiohhhhhhhhhhhhhhhhmmmmmmmmmmhhhhmmmmmmmhhhmmmmmmmmmmmmmmmdadadadammmmmmmm" + "damdamdmamdamdmamdmamdammdamdmmdmamdmamdmamdmamdma" + "mdamdmamdamdmamdmamdmamdmamdamdmamdmadma" + "h" + "adadaweqeqhwuhedihhhhhhhhhhhhhhhwadhwqgduawgduawgudaysudg" + "afawsdhsiahdiashdsahd" + "fhashfuisahfuiahuhhhhhhhhhhhhfh" + "'afhuahfhhhhhhhisahfuia" + "afashifhsaufhiqwye7qeqw7ewdhhhaigsdiagdisafgasufisafagdaugdugauyd" + "dasufgasugdusghhhhhhhhhhhhhhhhhha7q7eguwqgeqgdiagdiagdiagduaoqyhweq" + "hhhhh" + "daifhahdaghf7ahhhhhhhhhhhhhhwyf7adihdadoadoahdoahdiwhqehqw" + "hhhhhhhh" + "mamiahhhhhhhsdbcsagfagdsdiahduiahdizzzzz"; for (int i = 1; i <= 10; ++i) { str += str; } int max = Integer.MIN_VALUE; char c = ' '; for (int i = 0; i < str.length(); ++i) { int index = (int) str.charAt(i); if (++num[index] > max) { max = num[index]; c = str.charAt(i); } } System.out.println("max = " + max + " c = " + c); } }