반응형
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int test = scanner.nextInt();
String[] list = new String[test];
for(int i = 0; i < test; ++i) {
String s = scanner.next();
list[i] = s;
}
int cnt = 0;
for(String s : list){
boolean check = check(s);
if(check){
cnt++;
}
}
System.out.println(cnt);
}
public static boolean check(String s){
HashMap<Character, ArrayList<Integer>> map = new HashMap<>();
for(int i = 0; i < s.length(); ++i){
char a = s.charAt(i);
if(map.get(a) != null){
ArrayList<Integer> list = map.get(a);
list.add(i);
map.put(a,list);
}else{
ArrayList<Integer> list = new ArrayList<>();
list.add(i);
map.put(a, list);
}
}
Iterator it = map.keySet().iterator();
while(it.hasNext()){
ArrayList<Integer> list = map.get(it.next());
for(int i = 0; i < list.size(); ++i){
if(i > 0){
if(list.get(i) - list.get(i-1) >1){
return false;
}
}
}
}
return true;
}
}
|
cs |
반응형
'알고리즘 > 코드 연습' 카테고리의 다른 글
[LeetCode] Add Two Numbers (0) | 2021.12.30 |
---|---|
[백준 2445번] 별 찍기 - 8 (0) | 2020.11.27 |
[백준-1764] 듣보잡 (0) | 2020.07.31 |
[백준 - 1924] 2007년 (0) | 2020.07.29 |
[백준 - 2798] 블랙잭 (0) | 2020.07.24 |