leetcode 345. Reverse Vowels of a String

最新推荐文章于 2024-09-26 16:50:25 发布

af1312

最新推荐文章于 2024-09-26 16:50:25 发布

阅读量121

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/HelloWorld-5/p/5431766.html

版权

题目：

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 public class Solution {
 2     public String reverseVowels(String s) {
 3         int left = 0;
 4            int right = s.length() - 1;
 5            boolean leftstop=false;
 6            boolean rightstop=false;
 7            char[] strChar=s.toCharArray();
 8         while (left<right)
 9         {
10             if((strChar[left]+"").matches("[aeiouAEIOU]"))
11                 leftstop=true;
12             if((strChar[right]+"").matches("[aeiouAEIOU]"))
13                 rightstop=true;
14             if(leftstop&&rightstop)
15             {
16                 char temp=strChar[left];
17                 strChar[left]=strChar[right];
18                 strChar[right]=temp;
19                 leftstop=false;
20                 rightstop=false;
21             }
22             if(!leftstop)
23                 left++;
24             if(!rightstop)
25                 right--;
26         }
27         return new String(strChar);
28     }
29 }