Class Solution

java.lang.Object
g0801_0900.s0824_goat_latin.Solution

public class Solution extends Object
824 - Goat Latin.<p>Easy</p> <p>You are given a string <code>sentence</code> that consist of words separated by spaces. Each word consists of lowercase and uppercase letters only.</p> <p>We would like to convert the sentence to &ldquo;Goat Latin&rdquo; (a made-up language similar to Pig Latin.) The rules of Goat Latin are as follows:</p> <ul> <li>If a word begins with a vowel (<code>'a'</code>, <code>'e'</code>, <code>'i'</code>, <code>'o'</code>, or <code>'u'</code>), append <code>&quot;ma&quot;</code> 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>'a'</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> </ul> <p>Return <em>the final sentence representing the conversion from sentence to Goat Latin</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> sentence = &ldquo;I speak Goat Latin&rdquo;</p> <p><strong>Output:</strong> &ldquo;Imaa peaksmaaa oatGmaaaa atinLmaaaaa&rdquo;</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> sentence = &ldquo;The quick brown fox jumped over the lazy dog&rdquo;</p> <p><strong>Output:</strong> &ldquo;heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa&rdquo;</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= sentence.length <= 150</code></li> <li><code>sentence</code> consists of English letters and spaces.</li> <li><code>sentence</code> has no leading or trailing spaces.</li> <li>All the words in <code>sentence</code> are separated by a single space.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details