题目地址:https://leetcode.com/problems/reverse-vowels-of-a-string/open in new window

Total Accepted: 7758 Total Submissions: 22132 Difficulty: Easy

题目描述

Write a function that takes a string as input and reverse only the vowels of a string.

Example 1:

Input: "hello"
Output: "holle"

Example 2:

Input: "leetcode"
Output: "leotcede"

Note:

  • The vowels does not include the letter "y".

题目大意

把一个字符串中所有的元音字母倒序,其他位置不变。

解题方法

使用栈

理解题意很重要啊!

这个题的意思是把收尾向中间走的时候遇到的所有元音字符换位置。也就是说 "abecui"-->"ibucea";

把某个东西进行翻转,很容易想到栈。所以把元音字符进栈,再次遍历的时候遇到元音字符就出栈即可。

class Solution(object):
    def reverseVowels(self, s):
        """
        :type s: str
        :rtype: str
        """
        vstack = []
        for c in s:
            if c in "aeiouAEIOU":
                vstack.append(c)
        res = []
        for c in s:
            if c in "aeiouAEIOU":
                res.append(vstack.pop())
            else:
                res.append(c)
        return "".join(res)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

双指针

也就是用双指针的方法。一个从头查找,一个从尾查找。同时判断是否为元音字符,如果两个指针都是落在了元音字符上的时候,交换。别忘了交换位置之后前往下一个地点。

python代码如下:

class Solution(object):
    def reverseVowels(self, s):
        """
        :type s: str
        :rtype: str
        """
        N = len(s)
        res = list(s)
        left, right = 0, N - 1
        while left < right:
            while right >= 0 and res[right] not in "aeiouAEIOU":
                right -= 1
            while left < right and res[left] not in "aeiouAEIOU":
                left += 1
            if left < right:
                res[left], res[right] = res[right], res[left]
            left += 1
            right -= 1
        return "".join(res)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

Java代码如下:

public class Solution {
    public String reverseVowels(String s) {
        ArrayList<Character> list=new ArrayList();
        list.add('a');
        list.add('e');
        list.add('i');
        list.add('o');
        list.add('u');
        list.add('A');
        list.add('E');
        list.add('I');
        list.add('O');
        list.add('U');
        
        char[] array=s.toCharArray();
        
        int head=0;
        int tail=array.length-1;
        
        while(head<tail){
            if(!list.contains(array[head])){
                head++;
                continue;
            }
            if(!list.contains(array[tail])){
                tail--;
                continue;
            }
            char temp=array[head];
            array[head]=array[tail];
            array[tail]=temp;
            
            head++;
            tail--;
        }
        
        return new String(array);
    }
}

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

AC:11ms

C++代码如下:

class Solution {
public:
    string reverseVowels(string s) {
        const int N = s.size();
        int left = 0, right = N - 1;
        while (left < right) {
            while (left < N && !isVowel(s[left])) left ++;
            while (right >= 0 && !isVowel(s[right])) right --;
            if (left < right)
                swap(s[left], s[right]);
            left ++;
            right --;
        }
        return s;
    }
private:
    bool isVowel(char x) {
        string t = "aeiouAEIOU";
        return t.find(x) != string::npos;
    }
};

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

DDKK.COM 弟弟快看-教程,程序员编程资料站,版权归原作者所有

本文经作者:负雪明烛 授权发布,任何组织或个人未经作者授权不得转发