标签：lin 字符串 repr follow start star OWIN style def
2776. String Task
Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:
Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program‘s input is exactly one string, it should return the output as a single string, resulting after the program‘s processing the initial string.
Help Petya cope with this easy task.
The first line represents input string of Petya‘s program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.
Print the resulting string. It is guaranteed that this string is not empty.
tour
.t.r
Codeforces
.c.d.f.r.c.s
aBAcAba
.b.c.b
说明：输入一个字符串，将这些字母（不论大小写）从字符串中删除："A", "O", "Y", "E", "U", "I"，然后此字符串的其他字符前添加一个小数点，输出的字符串都是小写。总体的想法：先转小写，然后删除指定字符，然后添加小数点，最后输出。
import java.util.Scanner; public class Test2776 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String str = sc.nextLine().toLowerCase(); char[] chArr = str.toCharArray(); String vowels = "aeyiou"; // 删除元音字母（我又何必傻傻的真删除这个字符呢，不如将该字符设置为其他值，在拼接的时候，判断一下就行） for (int i = 0; i < chArr.length; i++) { if (vowels.indexOf(chArr[i]) != -1) { chArr[i]=‘1‘; } } str = ""; // 在辅音字母前添加小数点 for (int i = 0; i < chArr.length; i++) { if(chArr[i]!=‘1‘){ str += "." + chArr[i]; } } System.out.println(str); sc.close(); } }
标签：lin 字符串 repr follow start star OWIN style def
原文地址：https://www.cnblogs.com/tangxlblog/p/9973758.html
