[SW Expert Academy] 다양성 측정 (D3)

https://swexpertacademy.com/main/solvingProblem/solvingProblem.do

SW Expert Academy

 

String 사용

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {

			boolean isExist[] = new boolean[10];

			String str = sc.next();

			int count = 0;

			for (int i = 0; i < str.length(); i++) {

				if (!isExist[str.charAt(i)-'0']) {
					count++;
					isExist[str.charAt(i) - '0'] = true;
				}

			}

			System.out.println("#" + tc + " " + count);

		}

	}
}

 

 

int 사용

import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {

			boolean isExist[] = new boolean[10];

			int n = sc.nextInt();

			int count = 0;

			while (n > 0) {

				if (!isExist[n % 10]) {
					count++;
					isExist[n % 10] = true;
				}
				n /= 10;

			}
			System.out.println("#" + tc + " " + count);

		}
	}
}