Description:
A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.
We would like to convert the sentence to "Goat Latin" (a made-up language similar to Pig Latin.)
The rules of Goat Latin are as follows:
- If a word begins with a vowel (a, e, i, o, or u), append
"ma"to the end of the word.
For example, the word 'apple' becomes 'applema'.
- If a word begins with a consonant (i.e. not a vowel), remove the first letter and append it to the end, then add
"ma".
For example, the word"goat"becomes"oatgma".
- Add one letter
'a'to the end of each word per its word index in the sentence, starting with 1.
For example, the first word gets"a"added to the end, the second word gets"aa"added to the end and so on.
Return the final sentence representing the conversion from S to Goat Latin.
Example 1:
Input: "I speak Goat Latin" Output: "Imaa peaksmaaa oatGmaaaa atinLmaaaaa"
Example 2:
Input: "The quick brown fox jumped over the lazy dog" Output: "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"
Notes:
Scontains only uppercase, lowercase and spaces. Exactly one space between each word.1 <= S.length <= 150.
class Solution {
public String toGoatLatin(String S) {
String[] a = S.split("\\s");
String result = "";
for (int i = 0; i < a.length; i++) {
char b = a[i].charAt(0);
String aa = "a";
for (int j = 0; j < i; j++) {
aa = aa + "a";
}
if (b == 'a' || b == 'e' || b == 'i' || b == 'o'
|| b == 'u' || b == 'A' || b == 'E' || b == 'I' || b == 'O'
|| b == 'U') {
a[i] = a[i] + "ma" + aa;
}else {
a[i] = a[i].substring(1, a[i].length()) + b + "ma" + aa;
}
}
for (int i = 0; i < a.length; i++) {
result = result + a[i] + " ";
}
return result.substring(0,result.length()-1);
}
}
这里用到了去除string 开头以及结尾的函数:
去开头:a.substring(1,a.length());
去结尾:a.substring(0,a.length()-1);
本文介绍了一种将英语句子转换为Goat Latin的方法。Goat Latin是一种类似于Pig Latin的人造语言,遵循特定的转换规则。文章提供了一个Java实现的例子,包括如何根据单词的首字母进行不同的转换。
423

被折叠的 条评论
为什么被折叠?



