LeetCode - 343. Reverse Bowels the String(Two Pointers, String)

문제

Given a string s, reverse only all the vowels in the string and return it.
The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both lower and upper cases, more than once.

https://leetcode.com/problems/reverse-vowels-of-a-string/description/

Example 1:

Input: s = "hello"
Output: "holle"

Example 2:

Input: s = "leetcode"
Output: "leotcede"

풀이

class Solution {
    public String reverseVowels(String s) {
        if(s.length()==1) return s;
        Stack<Character> tmp = new Stack();
        for(char c : s.toCharArray()){
            if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u'
            ||c=='A'||c=='E'||c=='I'||c=='O'||c=='U') tmp.push(c);
        }

        StringBuilder res = new StringBuilder();
        for(char c : s.toCharArray()){
            if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u'
            ||c=='A'||c=='E'||c=='I'||c=='O'||c=='U'){
                res.append(tmp.peek());
                tmp.pop();
            }else{
                res.append(c);
            }
        }
        
        return res.toString();
        
    }
}