-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathI1_1.java
More file actions
43 lines (36 loc) · 1.19 KB
/
Copy pathI1_1.java
File metadata and controls
43 lines (36 loc) · 1.19 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
package intro;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class I1_1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
String findStr = sc.nextLine();
int cnt = solution(str, findStr);
System.out.println(cnt);
}
private static int solution(String str, String findStr) {
int answer = 0;
str = str.toLowerCase();
// RESULT CASE 1
// Map<Character, Integer> map = new HashMap<>();
// for (int i = 0; i < str.length(); i++) {
// map.put(str.charAt(i), map.getOrDefault(str.charAt(i), 0) + 1);
// }
// answer = map.getOrDefault(findStr.toLowerCase().charAt(0), 0);
// RESULT CASE 2
// for (char c : str.toCharArray()) {
// if (c == findStr.toLowerCase().charAt(0)) {
// answer++;
// }
// }
// 강의 풀이
str = str.toUpperCase();
char t = Character.toUpperCase(findStr.charAt(0));
for (int i = 0; i < str.length(); i++) {
if(str.charAt(i) == t) answer++;
}
return answer;
}
}