345. Reverse Vowels of a String

来源：互联网发布：数据化人生txt 编辑：程序博客网时间：2024/06/05 01:59

题目：https://leetcode.com/problems/reverse-vowels-of-a-string/

代码：

public class Solution {    public String reverseVowels(String s) {        char[] m = s.toCharArray();        int[] flag = new int[m.length];        Set t = new HashSet();        t.add('a');t.add('e');t.add('i');t.add('o');t.add('u');        t.add('A');t.add('E');t.add('I');t.add('O');t.add('U');        ArrayList n = new ArrayList();        for(int i=0;i<flag.length;i++)            flag[i] = 1;        for(int i=0;i<m.length;i++)        {            if(t.contains(m[i]))            {                flag[i] = 0;                n.add(m[i]);            }        }        char[] res = new char[m.length];        int index = n.size()-1;        for(int i=0;i<m.length;i++)        {            if(flag[i]==1)                res[i] = m[i];            else if(flag[i]==0)            {                res[i] = (char)n.get(index);                index--;            }        }        String result = String.valueOf(res);        return result;    }}16ms===============================discuss中有同堆栈来实现的，代码比较简洁stack

0 0