查找字符串中出现次数最多和最少字符的程序

2025 年 1 月 8 日 | 阅读时间：6 分钟

说明

在此程序中，我们需要计算字符串中存在的每个字符的出现次数，并找出出现次数最多和最少的字符。

在上面的示例中，字符“a”在字符串中只出现了一次。因此，它是出现次数最少的字符，并以红色突出显示。字符“e”在整个字符串中出现的次数最多，即 6 次。因此，它是出现次数最多的字符，并以绿色突出显示。

算法

定义一个字符串。
声明一个大小与字符串相同的数组 freq。数组 freq 将用于根据其索引存储唯一字符的计数。
变量 minChar 表示出现次数最少的字符，maxChar 表示出现次数最多的字符。最初，它们被初始化为字符串中的第一个字符。
将使用两个循环。外层循环选择一个字符，并将 freq 中相应的索引初始化为 1。
内层循环会将选定的字符与字符串中其余的字符进行比较。如果找到匹配项，则将 freq[i] 增加 1。
变量 min 和 max 用于存储出现次数最少和最多的字符的计数，它们最初会指向 freq[0] 的计数，即 freq[0] 的计数。
循环遍历数组 freq，并将 freq 中存储的每个字符的计数与 min 和 max 进行比较。
如果 freq 中存储的计数小于 min 的值，则将该计数存储在 min 中，并将相应字符存储在 minChar 中。
如果 freq 中存储的计数大于 max 的值，则将该计数存储在 max 中，并将相应字符存储在 maxChar 中。
循环结束后，minChar 将存储出现次数最少的字符，maxChar 将存储出现次数最多的字符。

解决方案

Python

string = "grass is greener on the other side";
freq = [None] * len(string);
minChar = string[0];
maxChar = string[0];
 
#Count each word in given string and store in array freq
for i in range(0, len(string)):
    freq[i] = 1;
    for j in range(i+1, len(string)):
        if(string[i] == string[j] and string[i] != ' ' and string[i] != '0'):
            freq[i] = freq[i] + 1;
            
            #Set string[j] to 0 to avoid printing visited character
            string = string[ : j] + '0' + string[j+1: ];
            
#Determine minimum and maximum occurring characters
min = max = freq[0];
for i in range(0, len(freq)):
    
    #If min is greater than frequency of a character
    #then, store frequency in min and corresponding character in minChar
    if(min > freq[i] and freq[i] != '0'):
        min = freq[i];
        minChar = string[i];
    #If max is less than frequency of a character 
    #then, store frequency in max and corresponding character in maxChar
    if(max < freq[i]):
        max = freq[i];
        maxChar = string[i];
 
print("Minimum occurring character: " + minChar);
print("Maximum occurring character: " + maxChar);

输出

Minimum occurring character: a
Maximum occurring character: e

C

#include <stdio.h>
#include <string.h>
 
int main()
{
    char string[] = "grass is greener on the other side";
    int i, j, min, max, length = strlen(string);
    char minChar = string[0], maxChar = string[0];
    int freq[length];
    
    //Count each word in given string and store in array freq
    for(i = 0; i < length; i++) {
        freq[i] = 1;
        for(j = i+1; j < length; j++) {
            if(string[i] == string[j] && string[i] != ' ' && string[i] != '0') {
                freq[i]++;
                
                //Set string[j] to 0 to avoid printing visited character
                string[j] = '0';
            }
        }
    }
    
    //Determine minimum and maximum occurring characters
    min = max = freq[0];
    for(i = 0; i < length; i++) {
        
        //If min is greater than frequency of a character 
        //then, store frequency in min and corresponding character in minChar
        if(min > freq[i] && freq[i] != '0') {
            min = freq[i];
            minChar = string[i];
        }
        //If max is less than frequency of a character 
        //then, store frequency in max and corresponding character in maxChar
        if(max < freq[i]) {
            max = freq[i];
            maxChar = string[i];
        }
    }
    
    printf("Minimum occurring character: %c\n", minChar);
    printf("Maximum occurring character: %c", maxChar);
        
    return 0;
}

输出

Minimum occurring character: a
Maximum occurring character: e

JAVA

public class Characters 
{
     public static void main(String[] args) {
        String str = "grass is greener on the other side";
        int[] freq = new int[str.length()];
        char minChar = str.charAt(0), maxChar = str.charAt(0);
        int i, j, min, max;        
        
        //Converts given string into character array
        char string[] = str.toCharArray();
        
        //Count each word in given string and store in array freq
        for(i = 0; i < string.length; i++) {
            freq[i] = 1;
            for(j = i+1; j < string.length; j++) {
                if(string[i] == string[j] && string[i] != ' ' && string[i] != '0') {
                    freq[i]++;
                    
                    //Set string[j] to 0 to avoid printing visited character
                    string[j] = '0';
                }
            }
        }
        
        //Determine minimum and maximum occurring characters
        min = max = freq[0];
        for(i = 0; i <freq.length; i++) {
            
            //If min is greater than frequency of a character 
            //then, store frequency in min and corresponding character in minChar
            if(min > freq[i] && freq[i] != '0') {
                min = freq[i];
                minChar = string[i];
            }
            //If max is less than frequency of a character 
            //then, store frequency in max and corresponding character in maxChar
            if(max < freq[i]) {
                max = freq[i];
                maxChar = string[i];
            }
        }
        
        System.out.println("Minimum occurring character: " + minChar);
        System.out.println("Maximum occurring character: " + maxChar);
    }
}

输出

Minimum occurring character: a
Maximum occurring character: e

C#

using System;
                    
public class Characters
{    
    public static void Main()
    {
        String str = "grass is greener on the other side";
        int[] freq = new int[str.Length];
        char minChar = str[0], maxChar = str[0];
        int i, j, min, max;        
        
        //Converts given string into character array
        char[] string1 = str.ToCharArray();
        
        //Count each word in given string and store in array freq
        for(i = 0; i < string1.Length; i++) {
            freq[i] = 1;
            for(j = i+1; j < string1.Length; j++) {
                if(string1[i] == string1[j] && string1[i] != ' ' && string1[i] != '0') {
                    freq[i]++;
                    
                    //Set string1[j] to 0 to avoid printing visited character
                    string1[j] = '0';
                }
            }
        }
        
        //Determine minimum and maximum occurring characters
        min = max = freq[0];
        for(i = 0; i < freq.Length; i++) {
            
            //If min is greater than frequency of a character 
            //then, store frequency in min and corresponding character in minChar
            if(min > freq[i] && freq[i] != '0') {
                min = freq[i];
                minChar = string1[i];
            }
            //If max is less than frequency of a character 
            //then, store frequency in max and corresponding character in maxChar
            if(max < freq[i]) {
                max = freq[i];
                maxChar = string1[i];
            }
        }
        
        Console.WriteLine("Minimum occurring character: " + minChar);
        Console.WriteLine("Maximum occurring character: " + maxChar);
    }
}

输出

Minimum occurring character: a
Maximum occurring character: e

PHP

<!DOCTYPE html>
<html>
<body>
<?php
$string = "grass is greener on the other side";
$freq = array();
$minChar = $maxChar = $string[0];        
 
//Count each word in given string and store in array freq
for($i = 0; $i < strlen($string); $i++) {
    array_push($freq, 1);
    for($j = $i+1; $j < strlen($string); $j++) {
        if($string[$i] == $string[$j] && $string[$i] != ' ' && $string[$i] != '0') {
            $freq[$i]++;
            
            //Set $string[$j] to 0 to avoid printing visited character
            $string[$j] = '0';
        }
    }
}
 
//Determine minimum and maximum occurring characters
$min = $max = $freq[0];
for($i = 0; $i < count($freq); $i++) {
    
    //If min is greater than frequency of a character 
    //then, store frequency in min and corresponding character in minChar
if($min > $freq[$i] && $freq[$i] != '0') {
    $min = $freq[$i];
    $minChar = $string[$i];
}
//If max is less than frequency of a character 
//then, store frequency in max and corresponding character in maxChar
if($max < $freq[$i]) {
    $max = $freq[$i];
    $maxChar = $string[$i];
}
}
 
print("Minimum occurring character: " . $minChar);
print("<br>Maximum occurring character: " . $maxChar);
?>
</body>
</html>

输出

Minimum occurring character: a
Maximum occurring character: e

下一主题#

查找字符串中出现次数最多和最少字符的程序

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

查找字符串中出现次数最多和最少字符的程序

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

计算长方体表面积的程序

查找二叉树中最大元素的程序

根据给定坐标查找三角形类型的程序

在二叉树中搜索节点的程序

从双向链表中删除中间新节点的程序

将英寸转换为厘米的程序

将英尺转换为毫米的程序

编写计算等腰三角形高（Altitude）的程序

将英尺转换为米的程序

确定一个字符串是否为另一个字符串的旋转的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器