Skip to content

Commit f7922f1

Browse files
committed
add PROGRAMMERS-84512
1 parent 8dba370 commit f7922f1

File tree

2 files changed

+28
-0
lines changed

2 files changed

+28
-0
lines changed

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -47,6 +47,7 @@
4747
| PROGRAMMERS-70129 |[java](programmers/problem70129)|[이진 변환 반복하기 (Repeat Binary Conversion)](https://school.programmers.co.kr/learn/courses/30/lessons/70129)|
4848
| PROGRAMMERS-72411 |[c++](programmers/problem72411)|[메뉴 리뉴얼 (Menu Renewal)](https://school.programmers.co.kr/learn/courses/30/lessons/72411)|
4949
| PROGRAMMERS-76502 |[java](programmers/problem76502)|[괄호 회전하기 (Rotate Parentheses)](https://school.programmers.co.kr/learn/courses/30/lessons/76502)|
50+
| PROGRAMMERS-84512 |[java](programmers/problem84512)|[모음 사전 (Vowel Dictionary)](https://school.programmers.co.kr/learn/courses/30/lessons/84512)|
5051
| PROGRAMMERS-87390 :star:|[java](programmers/problem87390)|[n^2 배열 자르기 (Cutting n^2 Array)](https://school.programmers.co.kr/learn/courses/30/lessons/87390)|
5152
| PROGRAMMERS-87946 :star:|[java](programmers/problem87946)|[피로도 (Fatigue)](https://school.programmers.co.kr/learn/courses/30/lessons/87946)|
5253
| PROGRAMMERS-92335 |[java](programmers/problem92335)|[k진수에서 소수 개수 구하기 (Counting Primes in k-Base)](https://school.programmers.co.kr/learn/courses/30/lessons/92335)|
Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
packageproblem84512;
2+
3+
publicclassVowelDictionary{
4+
publicstaticvoidmain(String[] args){
5+
finalvarsol = newVowelDictionary();
6+
finalvarword = "AAAAE";
7+
finalvarexpected = 6;
8+
finalvarresult = sol.solution(word);
9+
System.out.println("expected: " + expected + " result: " + result);
10+
}
11+
12+
publicintsolution(Stringword){
13+
finalvarvowels = newchar[]{'A', 'E', 'I', 'O', 'U'};
14+
finalvarincrement = newint[]{781, 156, 31, 6, 1};
15+
varanswer = 0;
16+
17+
for (vari = 0; i < word.length(); i++){
18+
for (varj = 0; j < vowels.length; j++){
19+
if (word.charAt(i) == vowels[j]){
20+
answer += 1 + increment[i] * j;
21+
}
22+
}
23+
}
24+
25+
returnanswer;
26+
}
27+
}

0 commit comments

Comments
(0)