package com.gyb.algorithm;

import java.util.ArrayList;
import java.util.List;

public class Test01 {
/*反转该字符串中的元音字母

• @param s

• @return
  */
  public static String reverseVowels(String s){
  char[] yuanyin={'a','e','i','o','u'};
  int s_Length=s.length();
  char[] s_char = s.toCharArray();
  char[] chars = new char[s.length()] ;
  int[] s_yy=new int[s_Length];
  for(int i=0;i<s_Length;i++){
  if(s_char[i] =='a' ||s_char[i] =='e' || s_char[i] =='i' || s_char[i] =='o'|| s_char[i] =='u'){
  s_yy[i]=i;
  }else{
  s_yy[i]=0;
  }
  }
  if(s_yy.length==0)
  return s;
  for(int k=0;k<s_yy.length;k++){
  System.out.print(s_yy[k]);
  }
  System.out.println("s_yy:"+String.valueOf(s_yy));

  for(int j=0;j<s_char.length;j++){
      if(s_char[j] =='a' || s_char[j] =='e' || s_char[j] =='i' || s_char[j] =='o'|| s_char[j] =='u'){
          chars[j] = s_char[s_yy[s_Length-j]];
      }else{
          chars[j] = s_char[j];
      }
  }
  return String.copyValueOf(chars);

  }

  /**

• 找出其中所有出现超过 ⌊ n/3 ⌋ 次的元素
• @param nums

• @return
  */
  public static List<Integer> majorityElement(int[] nums) {
  List list = new ArrayList();
  list.add(1);
  return list;
  }

  public static void main(String args[]){
  / String s="leetcode";
  System.out.println(s);
  System.out.println(reverseVowels(s));/
  }
  }