leetcode 345. 反转字符串中的元音字母

最新推荐文章于 2024-07-09 11:52:04 发布

ainstinct

最新推荐文章于 2024-07-09 11:52:04 发布

阅读量96

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/weixin_40392620/article/details/107602522

版权

数据结构与算法专栏收录该内容

97 篇文章 0 订阅

订阅专栏

编写一个函数，以字符串作为输入，反转该字符串中的元音字母。

//元音字母：a e i o u
class Solution {
    public String reverseVowels(String s) {
        char[] chr = s.toCharArray();
        int left = 0;
        int right = chr.length-1;
        String s1 = "aeiouAEIOU";
        while(left <right){
            while(left < right && !s1.contains(chr[left]+"")){
                left ++;
            }
            while(left < right && !s1.contains(chr[right]+"")){
                right--;
            }
            if(left > right){
                break;
            }
            char tmp = chr[left];
            chr[left] = chr[right];
            chr[right] = tmp;
            left++;
            right--;
        }
        return String.valueOf(chr);
    }
}

class Solution {
    public String reverseVowels(String s) {
        char[] chr = s.toCharArray();
        int left = 0;
        int right = chr.length-1;
        while(left <right){
            while(left<right &&chr[left] != 'a' && chr[left] != 'e' && chr[left] != 'i' && chr[left] != 'o' && chr[left] != 'u' && chr[left] != 'A' && chr[left] != 'E' && chr[left] != 'I' && chr[left] != 'O' && chr[left] != 'U'){
                left ++;
            }
            while(left<right &&chr[right] != 'a' && chr[right] != 'e' && chr[right] != 'i' && chr[right] != 'o' && chr[right] != 'u'&&chr[right] != 'A' && chr[right] != 'E' && chr[right] != 'I' && chr[right] != 'O' && chr[right] != 'U'){
                right --;
            }
            if(left > right){
                break;
            }
            char tmp = chr[left];
            chr[left] = chr[right];
            chr[right] = tmp;
            left++;
            right--;
        }
        return String.valueOf(chr);
    }
}