824. Goat Latin

Problem Link

Description

---

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.

  <ul>
  	<li>For example, the word <code>&quot;apple&quot;</code> becomes <code>&quot;applema&quot;</code>.</li>
  </ul>
  </li>
  <li>If a word begins with a consonant (i.e., not a vowel), remove the first letter and append it to the end, then add <code>&quot;ma&quot;</code>.
  <ul>
  	<li>For example, the word <code>&quot;goat&quot;</code> becomes <code>&quot;oatgma&quot;</code>.</li>
  </ul>
  </li>
  <li>Add one letter <code>&#39;a&#39;</code> to the end of each word per its word index in the sentence, starting with <code>1</code>.
  <ul>
  	<li>For example, the first word gets <code>&quot;a&quot;</code> added to the end, the second word gets <code>&quot;aa&quot;</code> added to the end, and so on.</li>
  </ul>
  </li>
  

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"

Example 2:

Input: sentence = "The quick brown fox jumped over the lazy dog"
Output: "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"

 

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.

Solution

---

Python3

class Solution:
    def toGoatLatin(self, S: str) -> str:
    
        vowel = {"a","e","i","o","u"}
        words = S.split(" ")
        i = 1
        ans = []
        for word in words:
            a = ""
            
            if word[0].lower() in vowel:
                a = word + "ma"
            else:
                a = word[1:] + word[0] + "ma"
            
            a += "a"*i
            i+=1
        
            ans.append(a)
        
        return " ".join(ans)