Escriba un programa Java que imprima el número de ocurrencias de cada carácter y que no imprima repetidamente las ocurrencias de caracteres duplicados como se indica en el ejemplo:
Ejemplos:
Input : geeksforgeeks Output : Number of Occurrence of g is:2 Number of Occurrence of e is:4 Number of Occurrence of k is:2 Number of Occurrence of s is:2 Number of Occurrence of f is:1 Number of Occurrence of o is:1 Number of Occurrence of r is:1
Acercarse:
La idea es crear una array de conteo de tamaño 256. Atraviese la string de entrada y para cada carácter incremente su conteo.
JAVA
// Java program for the above approach
class NoOfOccurenceOfCharacters {
static final int MAX_CHAR = 256;
static void getOccuringChar(String str)
{
// Create an array of size 256
// i.e. ASCII_SIZE
int count[] = new int[MAX_CHAR];
int len = str.length();
// Initialize count array index
for (int i = 0; i < len; i++)
count[str.charAt(i)]++;
// Create an array of given String size
char ch[] = new char[str.length()];
for (int i = 0; i < len; i++) {
ch[i] = str.charAt(i);
int find = 0;
for (int j = 0; j <= i; j++) {
// If any matches found
if (str.charAt(i) == ch[j])
find++;
}
if (find == 1)
System.out.println(
"Number of Occurrence of "
+ str.charAt(i)
+ " is:" + count[str.charAt(i)]);
}
}
// Driver Code
public static void main(String[] args)
{
String str = "geeksforgeeks";
getOccuringChar(str);
}
}
Producción:
Number of Occurrence of g is:2 Number of Occurrence of e is:4 Number of Occurrence of k is:2 Number of Occurrence of s is:2 Number of Occurrence of f is:1 Number of Occurrence of o is:1 Number of Occurrence of r is:1
Complejidad del tiempo : O(n 2 )
Espacio Auxiliar: O(256)
Publicación traducida automáticamente
Artículo escrito por Bishal Kumar Dubey y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA