首页 > 其他 > 详细

Leetcode: Reverse Vowels of a String

时间:2016-11-24 09:28:30      阅读:255      评论:0      收藏:0      [点我收藏+]
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".

Two Pointers 解法, 注意大小写

 1 public class Solution {
 2     public String reverseVowels(String s) {
 3         StringBuffer res = new StringBuffer(s);
 4         int l=0, r=s.length()-1;
 5         while (l < r) {
 6             while (l<r && !isVowel(res.charAt(l))) l++;
 7             while (l<r && !isVowel(res.charAt(r))) r--;
 8             if (l == r) break;
 9             char temp = res.charAt(l);
10             res.setCharAt(l, res.charAt(r));
11             res.setCharAt(r, temp);
12             l++;
13             r--;
14         }
15         return res.toString();
16     }
17     
18     public boolean isVowel(char c) {
19         if (c==‘a‘ || c==‘e‘ || c==‘i‘ || c==‘o‘ || c==‘u‘|| c==‘A‘ || c==‘E‘ || c==‘I‘ || c==‘O‘ || c==‘U‘) return true;
20         else return false;
21     }
22 }

 

Leetcode: Reverse Vowels of a String

原文:http://www.cnblogs.com/EdwardLiu/p/6096319.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!