programming-examples/java/Data_Structures/Count.java

53 lines
1.3 KiB
Java
Raw Normal View History

2019-11-15 12:59:38 +01:00
import edu.princeton.cs.introcs.StdIn;
import edu.princeton.cs.introcs.StdOut;
/*************************************************************************
* Compilation: javac Count.java
* Execution: java Count alpha < input.txt
*
* Create an alphabet specified on the command line, read in a
* sequence of characters over that alphabet (ignoring characters
* not in the alphabet), computes the frequency of occurrence of
* each character, and print out the results.
*
* % java Count ABCDR < abra.txt
* A 5
* B 2
* C 1
* D 1
* R 2
*
* % java Count 0123456789 < pi.txt
* 0 99959
* 1 99757
* 2 100026
* 3 100230
* 4 100230
* 5 100359
* 6 99548
* 7 99800
* 8 99985
* 9 100106
*
*************************************************************************/
public class Count {
public static void main(String[] args) {
Alphabet alpha = new Alphabet(args[0]);
int R = alpha.R();
int[] count = new int[R];
String a = StdIn.readAll();
int N = a.length();
for (int i = 0; i < N; i++)
if (alpha.contains(a.charAt(i)))
count[alpha.toIndex(a.charAt(i))]++;
for (int c = 0; c < R; c++)
StdOut.println(alpha.toChar(c) + " " + count[c]);
}
}