345. Reverse Vowels of a String

Java

public class Solution {
    public String reverseVowels(String s) {
        String tmp="";
        for(int i=0;i<s.length();i++)
        {
            char v=s.charAt(i);
            if(v=='a'||v=='e'||v=='i'||v=='o'||v=='u'||v=='A'||v=='E'||v=='I'||v=='O'||v=='U')
            tmp+=v;
        }
        StringBuffer result=new StringBuffer();
        int count=0;
        int tmpl=tmp.length();
        for(int j=0;j<s.length();j++)
        {
            char w=s.charAt(j);
            if(w=='a'||w=='e'||w=='i'||w=='o'||w=='u'||w=='A'||w=='E'||w=='I'||w=='O'||w=='U')
            {
            result.append(tmp.charAt(tmpl-1-count));
            count++;
            }
            else
            result.append(s.charAt(j));
        }
        return result.toString();
    }
}

另一种想法，Java，直接化成数组进行reverse

public String reverseVowels(String s) {
    char[] ch = s.toCharArray();
    char tmp;
    int p1 = 0 , p2 = s.length()-1;
    loop: 
    while(p1 < p2){
        while(ch[p1] != 'a' && ch[p1] != 'e' && ch[p1] != 'i' && ch[p1] != 'o' && ch[p1] != 'u' && ch[p1] != 'A' && ch[p1] != 'E' && ch[p1] != 'I' && ch[p1] != 'O' && ch[p1] != 'U'){
            p1 ++;
            if(p1 >= p2)
                break loop;
        }   
        while(ch[p2] != 'a' && ch[p2] != 'e' && ch[p2] != 'i' && ch[p2] != 'o' && ch[p2] != 'u' && ch[p2] != 'A' && ch[p2] != 'E' && ch[p2] != 'I' && ch[p2] != 'O' && ch[p2] != 'U'){
            p2 --;
            if(p1 >= p2)
                break loop;
        }
        tmp = ch[p1];
        ch[p1] = ch[p2];
        ch[p2] = tmp;
        
        p1 ++;
        p2 --;
    }
    return new String(ch);
｝