Goat Latin

Give you a sentence consisting of several words sentence , Words are separated by spaces . Each word consists only of uppercase and lowercase letters .
Please translate the sentence into “ Goat Latin （Goat Latin）”（ A similar Pig Latin - Pig Latin The fictional language of ）. The rules of goat Latin are as follows ：
If the word begins with a vowel （‘a’, ‘e’, ‘i’, ‘o’, ‘u’）, Add... After the word "ma".
for example , word “apple” Turn into “applema” .
If the word begins with a consonant （ namely , Non vowel letter ）, Remove the first character and put it at the end , Then add "ma".
for example , word “goat” Turn into “oatgma” .
According to the index of words in sentences , Add at the end of the word the same number of letters as the index ’a’, Index from 1 Start .
for example , Add... After the first word “a” , Add... After the second word “aa” , And so on .
Return to sentence Sentence after conversion to goat Latin .
source ： Power button （LeetCode）

AC Code

class Solution:
    def toGoatLatin(self, sentence: str) -> str:
        def change(word, idx):
            if word[0] in ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']:
                return word + 'ma' + 'a' * (idx + 1)
            else:
                return word[1:] + word[0] + 'ma' + 'a' * (idx + 1)
        senlist= sentence.split(' ')
        res = ''
        for idx, word in enumerate(senlist):
            if idx < len(senlist) - 1: 
                res += change(word, idx) + ' '
                
            else:
                res += change(word, idx)
        return  res

Official code

class Solution:
    def toGoatLatin(self, sentence: str) -> str:
        vowels = {
    "a", "e", "i", "o", "u", "A", "E", "I", "O", "U"}

        n = len(sentence)
        i, cnt = 0, 1
        words = list()

        while i < n:
            j = i
            while j < n and sentence[j] != " ":
                j += 1
            
            cnt += 1
            if sentence[i] in vowels:
                words.append(sentence[i:j] + "m" + "a" * cnt)
            else:
                words.append(sentence[i+1:j] + sentence[i] + "m" + "a" * cnt)
            
            i = j + 1
        
        return " ".join(words)


#  author ：LeetCode-Solution

The official solution is also the idea of simulation , But it doesn't directly use split This method , Instead, I chose to traverse character by character , It's a return to tradition