
-Code
class Solution {
static char[] vowels = {'a', 'e', 'i', 'o', 'u'};
public String reverseVowels(String s) {
List<Character> sVowels = new ArrayList<>();
for (char c : s.toCharArray()) {
if (checkVowel(c)) {
sVowels.add(c);
}
}
StringBuilder sb = new StringBuilder();
int idx = sVowels.size() - 1;
for (char c : s.toCharArray()) {
if (checkVowel(c)) {
sb.append(sVowels.get(idx));
idx--;
} else {
sb.append(c);
}
}
return sb.toString();
}
private static boolean checkVowel(char c) {
int ch = Character.toLowerCase(c);
for (char vowel :vowels) {
if (ch == vowel) return true;
}
return false;
}
}'Beakjoon&프로그래머스 > Java' 카테고리의 다른 글
| [백준/Java] 27025번 Morning Exercises (0) | 2025.12.20 |
|---|---|
| [LeetCode/Java] Reverse Words in a String (0) | 2025.12.19 |
| [LeetCode/Java] Can Place Flowers (0) | 2025.12.19 |
| [LeetCode/Java] Kids With the Greatest Number of Candies (0) | 2025.12.19 |
| [LeetCode/Java] Greatest Common Divisor of Strings (0) | 2025.12.19 |