// Source : https://leetcode-cn.com/problems/reverse-vowels-of-a-string/
// Date : 2021-11-7
简单题我依旧重拳出击
class Solution {
public:
string reverseVowels(string s)
{
//直接定义字符串,然后每次看当前字符是否在该字符串中
string t = "aeiouAEIOU";
for(int i = 0, j = s.size() - 1;i < j;)
{
while(t.find(s[i]) == -1 && i < j)
i++;
while(t.find(s[j]) == -1 && i < j)
j--;
//交换以后要将i,j分别移动,否则会报超时
if(i


