[Summer/Winter Coding(~2018)] 스킬트리
[Summer/Winter Coding(~2018)] 스킬트리
🙋♂️ 들어가며
이번 문제는 조건별 분기만 잘 작성하면 되는 문제다
✅ 코드
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
class Solution {
public int solution(String skill, String[] skill_trees) {
int answer = 0;
int T = skill_trees.length;
for (int i = 0; i < T; i++) {
String temp = skill_trees[i];
char[] cur_skill_trees = temp.toCharArray();
char[] s = skill.toCharArray();
int idx = 0;
boolean stop = false;
for (int j = 0; j < cur_skill_trees.length; j++) {
for (int k = 0; k < s.length; k++) {
char cur_val = cur_skill_trees[j];
if (cur_val == s[k]) {
if (s[idx] == cur_val) {
idx++;
}
else {
stop = true;
break;
}
}
if (stop) break;
}
if (stop) break;
}
if (!stop) answer++;
}
return answer;
}
}
This post is licensed under CC BY 4.0 by the author.

