JuniorString
Goat Latin
You are given a string sentence that consist 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. - 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". - Add one letter
'a'to the end of each word per its word index in the sentence, starting with1.
Return the final sentence representing the conversion from sentence to Goat Latin.
Example 1
Input
sentence = "I speak Goat Latin"Output
"Imaa peaksmaaa oatGmaaaa atinLmaaaaa"Each word is transformed according to the Goat Latin rules and receives an increasing number of trailing 'a' characters.
Example 2
Input
sentence = "The quick brown fox jumped over the lazy dog"Output
"heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"Each word is converted by moving an initial consonant when needed, adding "ma", and appending 'a' characters based on its position.
Constraints
- 1 <= sentence.length <= 150
- sentence consists of English letters and spaces.
- sentence has no leading or trailing spaces.
- All the words in sentence are separated by a single space.