import java.util.HashSet;
public class Solution {
static HashSet<Character> set = new HashSet<>();
static{
set.add('a');
set.add('e');
set.add('i');
set.add('o');
set.add('u');
set.add('A');
set.add('E');
set.add('I');
set.add('O');
set.add('U');
}
public String reverseVowels(String s) {
char[] chs = s.toCharArray();
int start =0,end = chs.length-1;
char temp;
while(start<end){
if(set.contains(chs[start])){
while(!set.contains(chs[end])){
end--;
}
if(start!=end){
temp = chs[start];
chs[start] = chs[end];
chs[end] = temp;
end--;
}
}
start++;
}
return new String(chs);
}
}
LeetCode 345 反转元音字符串
最新推荐文章于 2023-02-26 17:03:51 发布