python leetcode 824. Goat Latin

最新推荐文章于 2020-06-22 15:17:59 发布

原创最新推荐文章于 2020-06-22 15:17:59 发布 · 862 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #letcode

leetcode_python 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种特殊的语言转换方法——Goat Latin。该转换规则包括：若单词首字母为元音，则在末尾添加ma及对应数量的a；若首字母为辅音，则将首字母移至末尾并添加ma及对应数量的a。通过实例演示了如何将普通英语句子转换为Goat Latin。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

转化成"Goat Latin" ：如果一个单词以元音开头（a，e，i，o或u），则在单词的末尾添加“ma”；如果一个单词以辅音开头（即不是元音），则将第一个字母移到末尾，然后添加“ma”；如果是在句子中，则在每个单词的末尾添加字母'a'，'a'的个数从1依次递增。

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:

S contains only uppercase, lowercase and spaces. Exactly one space between each word.

1 <= S.length <= 150.

class Solution:
def toGoatLatin(self, S):
"""
:type S: str
:rtype: str
"""
ans = []
S = S.split(" ")[:]
for i in range(len(S)):
if S[i][0].lower() in "aeiou":
word = S[i] + "ma" + (i+1)*"a"
else:
word = S[i][1 :] + S[i][0] + "ma" + (i+1)*"a"
ans.append(str(word))
return " ".join(ans)