题目:Reverse Vowels of a String
原题链接:https://leetcode.com/problems/reverse-vowels-of-a-string/
Write a function that takes a string as input and reverse only the vowels of a string.
Example 1:
Given s = “hello”, return “holle”.
Example 2:
Given s = “leetcode”, return “leotcede”.
Note:
The vowels does not include the letter “y”.
设计算法将字符串中所有元音字母的顺序逆置。
例:
“hello” -> “holle”
“leetcode” -> “leotcede”
扫描一遍字符串,记录所有的元音字母的下标,然后逆置。
代码如下:
class Solution {
public:
bool isVowels(char s) {
if(s == 'a' || s == 'e' || s == 'i' || s == 'o' || s == 'u' || s == 'A' || s == 'E' || s == 'I' || s == 'O' || s == 'U') return true;
return false;
}
string reverseVowels(string s) {
vector<int> index;
int len = s.length();
for(int i = 0; i < len; ++i) {
if(isVowels(s[i])) index.push_back(i);
}
len = index.size();
for(int i = 0; i < len / 2; ++i) swap(s[index[i]], s[index[len - 1 - i]]);
return s;
}
};