LeetCode 345. Reverse Vowels of a String

问题描述

• 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”.
• 地址

问题分析

• LeetCode 344. Reverse String 的进阶题目,做法类似于LeetCode 125. Valid Palindrome，运用前后双指针对撞的技巧。

代码实现

• 提供了两种形式的双指针做法

class Solution {
    public String reverseVowels(String s) {
        if (s == null || s.length() <= 1) {
            return s;
        }
        char[] chs = s.toCharArray();
        int left = 0;
        int right = chs.length - 1;
        while (left < right) {
            while (left < right && ! isVowel(chs[left])) {
                ++left;
            }
            while (left < right && ! isVowel(chs[right])) {
                --right;
            }
            char temp = chs[left];
            chs[left++] = chs[right];
            chs[right--] = temp;
        }
        /*
        while (left < right) {
            if (! isVowel(chs[left])) {
                ++left;
            }else if(! isVowel(chs[right])){
                --right;
            }else {
                char temp = chs[left];
                chs[left] = chs[right];
                chs[right] = temp;
                ++left;
                --right;
            }
        }
        */
        return new String(chs);
    }

    public boolean isVowel(char ch) {
        ch = Character.toLowerCase(ch);
        return ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u';
    }
}