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"
思路:這題純粹考察stringbuilder的操作,按照三條原則寫就可以了;適合做電面題;
class Solution {
public String toGoatLatin(String S) {
if(S == null || S.length() == 0) {
return S;
}
HashSet<Character> set = new HashSet<>();
set.add('a');set.add('e');set.add('i');set.add('o');set.add('u');
set.add('A');set.add('E');set.add('I');set.add('O');set.add('U');
String[] splits = S.split(" ");
StringBuilder sb = new StringBuilder();
for(int i = 0; i < splits.length; i++) {
String newWord = changeWord(set, splits[i], i);
sb.append(newWord).append(" ");
}
return sb.toString().trim();
}
private String changeWord(HashSet<Character> set, String word, int i) {
StringBuilder sb = new StringBuilder();
if(set.contains(word.charAt(0))) {
sb.append(word)
.append("ma");
} else {
sb.append(word.substring(1, word.length()))
.append(word.charAt(0))
.append("ma");
}
for(int k = 0; k < i + 1; k++) {
sb.append("a");
}
return sb.toString();
}
}