【LeetCode】goat Latin

题目描述：

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. 

题目大意：

山羊拉丁文的规则如下：

如果单词以元音开头（a, e, i, o, u），在单词后添加"ma"。
例如，单词"apple"变为"applema"。
如果单词以辅音字母开头（即非元音字母），移除第一个字符并将它放到末尾，之后再添加"ma"。
例如，单词"goat"变为"oatgma"。
根据单词在句子中的索引，在单词最后添加与索引相同数量的字母'a'，索引从1开始。
例如，在第一个单词后添加"a"，在第二个单词后添加"aa"，以此类推。
返回将 S 转换为山羊拉丁文后的句子。
 

class Solution(object):
    def toGoatLatin(self, S):
        """
        :type S: str
        :rtype: str
        """
        strL = S.split()
        ch = ''
        for item in strL:
            index = strL.index(item)
            if item[0] in "aeiouAEIOU":
                ch = item + "ma"
                strL[index] = ch
            else:
                ch = item[1:] + item[0] + "ma"
                strL[index] = ch
        ch = ''
        lastIndex = -1
        for item in strL:
            index = strL.index(item, lastIndex + 1)
            lastIndex = index
            ch += item + 'a'*(index+1) + " "
        return ch[:len(ch)-1]

这题用python解决是比较简单的，代码量也没有C++那么大，对于字符类的问题，py要比C++好用的多