No345.java

packageAlgorithm.leetcode.String;

importjava.util.HashSet;
importjava.util.Set;

/**
 * 
 * Created by tujietg on Nov 6, 2019
 */
publicclassNo345 {
publicStringreverseVowels(Strings) {
char[] list = s.toCharArray();
SetnewSet = newHashSet();
newSet.add('a');
newSet.add('e');
newSet.add('i');
newSet.add('o');
newSet.add('u');
newSet.add('A');
newSet.add('E');
newSet.add('I');
newSet.add('O');
newSet.add('U');
for (inti = 0, j = list.length - 1; i < j;) {
if (!newSet.contains(list[i])) {
i++;
continue;
 }
if (!newSet.contains(list[j])) {
j--;
continue;
 }
chartmp = list[i];
list[i] = list[j];
list[j] = tmp;
j--;
i++;
 }
returnString.valueOf(list);
 }
}