leetcode 345. Reverse Vowels of a String

来源:互联网 发布:互联网公司数据分析 编辑:程序博客网 时间:2024/06/08 18:58

leetcode 345. Reverse Vowels of a String


import java.util.HashSet;import java.util.Set;public class Solution {    public static char[] cset = {'a','o','e','i','u','A','O','I','E','U'};    public String reverseVowels(String s) {        Set<Character> vowelsets = new HashSet<Character>();        for(Character c:cset){        vowelsets.add(c);        }        char[] c = s.toCharArray();        int i = 0,j = c.length-1;        while(i<j){            if(vowelsets.contains(c[i])&&vowelsets.contains(c[j])){                char tmp = c[i];                c[i] = c[j];                c[j] = tmp;                i++;                j--;            }else if(vowelsets.contains(c[i])){                j--;            }else if(vowelsets.contains(c[j])){                i++;            }else{                i++;                j--;            }        }        return new String(c);    }}


0 0
原创粉丝点击