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".
例子1:
给定 s = "hello" ,返回 "holle"。
例子2:
给定 s = "leetcode" ,返回 "leotcede"。
我自己给的提示:元音字母包括a、e、i、o、u对应的大小写。
题目不难,用一个栈就轻松搞定。关键是这输入整了我好几回。。。
class Solution {
public:
string reverseVowels(string s) {
stack<char> temp;
int len = s.size();
if(len == 0) return s;
for(int i = 0; i < len ; 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')
temp.push(s[i]);
}
if(temp.empty() || temp.size() == 1) return s;
for(int i =0 ; i < len ; 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')
{
s[i] = temp.top();
temp.pop();
}
}
return s;
}
};