PAT (Basic Level) 1021 个位数统计 (15分)JAVA解法

输入样例：

100311

输出样例：

0:2
1:3
3:1

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
 
public class Main {
 
	public static int SIZE=1000;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
	String str=sc.nextLine();
	
	int n;
	n = str.length();
	//int a[10] = { 0 };
	int[] a = new int[10];
	for (int i = 0; i < n; i++)
	{
		char[] t = str.toCharArray();
		switch (t[i])
		{
		case '0':
			a[0]++;
			break;
		case '1':
			a[1]++;
			break;
		case '2':
			a[2]++;
			break;
		case '3':
			a[3]++;
			break;
		case '4':
			a[4]++;
			break;
		case '5':
			a[5]++;
			break;
		case '6':
			a[6]++;
			break;
		case '7':
			a[7]++;
			break;
		case '8':
			a[8]++;
			break;
		case '9':
			a[9]++;
			break;
	}
	}
	StringBuilder sb = new StringBuilder();
	for (int i = 0; i < 10; i++)
	{
		if (a[i] != 0) {
			//System.out.print(i+":"+a[i]);
			sb.append(i+":"+a[i]+"\n");
		}
			
	}
	System.out.println(sb.subSequence(0, sb.length()-1));

	}
}