本文概述

• 建议：在继续解决方案之前, 请先在{IDE}上尝试使用你的方法。
• C ++
• Java
• Python3
• C#

给定一个包含小写字符的字符串。任务是在输入字符串中打印出现的最大字符。如果2个或更多字符出现相同的次数, 则按字典(字母顺序)最低(第一个)字符打印。
【输入字符串中出现的最大字符数|s2】例子：

输入：测试样本输出：e" t", " e"和" s"出现2次, 但" e"是字典上最小的字符。输入：示例程序输出：a

推荐：请尝试以下方法{IDE}首先, 在继续解决方案之前。在里面以前文章中, 如果在最大时间范围内出现多个字符, 则将返回任何字符。在这篇文章中, 返回所有字符中按字典顺序最小的字符。
方法：声明一个频率[26]用作哈希表的数组, 用于存储输入字符串中每个字符的频率。迭代字符串并增加计数频率展开]对于每个字符。遍历频率[]从左到右排列, 并跟踪到目前为止具有最大频率的字符。 freq [i]处的值表示字符(i +'a')的频率。
下面是上述方法的实现：
C ++

// C++ implementation to find // the maximum occurring character in // an input string which is lexicographically first #include < bits/stdc++.h> using namespace std; // function to find the maximum occurring character in // an input string which is lexicographically first char getMaxOccurringChar( char str[]) { // freq[] used as hash table int freq[26] = { 0 }; // to store maximum frequency int max = -1; // to store the maximum occurring character char result; // length of 'str' int len = strlen (str); // get frequency of each character of 'str' for ( int i = 0; i < len; i++) freq[str[i] - 'a' ]++; // for each character, where character is obtained by // (i + 'a') check whether it is the maximum character // so far and accodingly update 'result' for ( int i = 0; i < 26; i++) if (max < freq[i]) { max = freq[i]; result = ( char )(i + 'a' ); }// maximum occurring character return result; }// Driver Code int main() { char str[] = "sample program" ; cout < < "Maximum occurring character = " < < getMaxOccurringChar(str); return 0; }

Java

// Java implementation to find // the maximum occurring character in // an input string which is lexicographically firstclass GFG {// function to find the maximum occurring character in // an input string which is lexicographically first static char getMaxOccurringChar( char str[]) { // freq[] used as hash table int freq[] = new int [ 26 ]; // to store maximum frequency int max = - 1 ; // to store the maximum occurring character char result = 0 ; // length of 'str' int len = str.length; // get frequency of each character of 'str' for ( int i = 0 ; i < len; i++) { if (str[i] != ' ' ) { freq[str[i] - 'a' ]++; } }// for each character, where character is obtained by // (i + 'a') check whether it is the maximum character // so far and accodingly update 'result' for ( int i = 0 ; i < 26 ; i++) { if (max < freq[i]) { max = freq[i]; result = ( char ) (i + 'a' ); } }// maximum occurring character return result; }// Driver Code public static void main(String[] args) { char str[] = "sample program" .toCharArray(); System.out.println( "Maximum occurring character = " + getMaxOccurringChar(str)); } } // This code is contributed by 29AjayKumar

Python3

# Python 3 implementation to find the # maximum occurring character in an input # string which is lexicographically first# function to find the maximum occurring # character in an input string which is # lexicographically first def getMaxOccurringChar( str ):# freq[] used as hash table freq = [ 0 for i in range ( 100 )] # to store maximum frequency max = - 1# to store the maximum occurring # character length of 'str' len__ = len ( str )# get frequency of each character of 'str' for i in range ( 0 , len__, 1 ): freq[ ord ( str [i]) - ord ( 'a' )] + = 1# for each character, where character # is obtained by (i + 'a') check whether # it is the maximum character so far and # accodingly update 'result' for i in range ( 26 ): if ( max < freq[i]): max = freq[i] result = chr ( ord ( 'a' ) + i)# maximum occurring character return result# Driver Code if __name__ = = '__main__' : str = "sample program" print ( "Maximum occurring character =" , getMaxOccurringChar( str ))# This code is contributed by # Surendra_Gangwar

C#

// C# implementation to find // the maximum occurring character in // an input string which is lexicographically firstusing System; class GFG {// function to find the maximum occurring character in // an input string which is lexicographically first static char getMaxOccurringChar( string str) { // freq[] used as hash table int [] freq = new int [26]; // to store maximum frequency int max = -1; // to store the maximum occurring character char result = ( char )0; // length of 'str' int len = str.Length; // get frequency of each character of 'str' for ( int i = 0; i < len; i++) { if (str[i] != ' ' ) { freq[str[i] - 'a' ]++; } }// for each character, where character is obtained by // (i + 'a') check whether it is the maximum character // so far and accodingly update 'result' for ( int i = 0; i < 26; i++) { if (max < freq[i]) { max = freq[i]; result = ( char ) (i + 'a' ); } }// maximum occurring character return result; }// Driver Code public static void Main() { string str = "sample program" ; Console.WriteLine( "Maximum occurring character = " + getMaxOccurringChar(str)); } }

输出如下：

Maximum occurring character = a

时间复杂度：
上)。
辅助空间：
O(1)。
资源： 佩剑面试经验|套装2

推荐阅读

• 

  最旺宅的植物招财 招财又旺宅又喜阴的植物
• 

  老版本迅雷
• 

  咸鸭蛋洗掉泥后怎么保存
• 

  E97几时出,E93、 E97代表着什么汽油？
• 

  学生练字作品展示
• 

  投稿|时隔4年EDG重回王座，LPL无畏竞巅峰
• 

  新浪页游助手怎么查看辅助工具？
• 

  mysql查询优化,索引优化,存储优化 优化mysql索引
• 

  产品经理的第一次面试总结
• 

  如何让x27耗电慢方法有哪些
• 

  女人吃百合有什么好处 女人吃百合有什么好处和坏处
• 

  尼康180微距镜头与200微距比较 尼康微距180微距
• 

  《林中水滴》散文分享｜树的生活—森林深处
• 

  diptyque怎么读 英语diptyque怎么读
• 

  排队论案例分析
• 

  尿布疹还能用爽身粉吗
• 

  努力，才是人生的态度！
• 

  颜值和灵魂的碰撞
• 

  刀具可以带上飞机吗 坐飞机刀具能带吗
• 

  华为手机怎么检测回收，华为手机怎么看回收价格

• 经典推荐（一些有用的Linux技巧详细介绍）
• Python检查两个列表是否相同
• python访问MySQL数据库及其操作详解 – Python高级开发教程
• python CGI编程和Web开发 – Python高级开发教程
• python面向对象编程（类和对象详解介绍 – Python高级开发教程）
• python异常处理和断言 – Python入门开发教程
• python函数定义和操作详解介绍 – Python入门开发教程
• 如何为道德黑客建立个人实验室（）
• jQuery Timepicker插件用法详细教程