1、双指针比较
    ``char``[] ``chars``=``s``.``toCharArray``();
    ``int`` ``n``=``chars``.``length``;
    ``int`` ``left``=``0``;
    ``int`` ``right``=n-``1``;
    while``(left<right){
    ``if``(``isVowel``(chars[left])&&``isVowel``(chars[right])){
    ``char`` ``k``=chars[left];
    chars[left]=chars[right];
    chars[right]=k;
    left++;right--;
    }
    ``if``(!``isVowel``(chars[left])){
    left++;
    }
    ``if``(!``isVowel``(chars[right])){
    right--;
    }
    }
    2、二分法查找末班
    ``int`` ``n``=``nums``.``length``;
    ``int`` ``left``=``0``;
    ``int`` ``right``=n-``1``;
    ``while``(left<=right){//这题是为了找到与target相同的值的索引，没有该值的话，就输出排序后该值应放的索引位置
    ``int`` ``mid``=left+(right-left)/``2``;
    ``if``(target<=nums[mid]){
    right=mid-``1``;
    }``else``{
    left=mid+``1``;
    }
    }
    ``return`` left;
    }