class Solution {
public:
string reverseVowels(string s) {
int i=0,j=s.size()-1;
for(;i<=j;i++){
if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u'||
s[i]=='A'||s[i]=='E'||s[i]=='I'||s[i]=='O'||s[i]=='U'){
for(;i<=j;){
if(s[j]=='a'||s[j]=='e'||s[j]=='i'||s[j]=='o'||s[j]=='u'||
s[j]=='A'||s[j]=='E'||s[j]=='I'||s[j]=='O'||s[j]=='U'){
int temp=s[i];
s[i]=s[j];
s[j]=temp;
j--;
break;
}else{
j--;
}
}
}
}
return s;
}
};
leetcode345. 反向串
最新推荐文章于 2022-08-23 23:21:50 发布