feat: add solutions to lc problem: No.0824

No.0824.Goat Latin

Author: yanglbme

solution/0800-0899/0824.Goat Latin/README.md

@@ -46,7 +46,6 @@
 	<li><code>1 &lt;= S.length &lt;= 150</code>。</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -58,15 +57,46 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def toGoatLatin(self, sentence: str) -> str:
+        ans = []
+        for i, word in enumerate(sentence.split()):
+            if word.lower()[0] not in ['a', 'e', 'i', 'o', 'u']:
+                word = word[1:] + word[0]
+            word += 'ma'
+            word += 'a' * (i + 1)
+            ans.append(word)
+        return ' '.join(ans)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String toGoatLatin(String sentence) {
+        List<String> ans = new ArrayList<>();
+        Set<Character> vowels = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
+        int i = 1;
+        for (String word : sentence.split(" ")) {
+            StringBuilder t = new StringBuilder();
+            if (!vowels.contains(word.charAt(0))) {
+                t.append(word.substring(1));
+                t.append(word.charAt(0));
+            } else {
+                t.append(word);
+            }
+            t.append("ma");
+            for (int j = 0; j < i; ++j) {
+                t.append("a");
+            }
+            ++i;
+            ans.add(t.toString());
+        }
+        return String.join(" ", ans);
+    }
+}
 ```
 
 ### **...**

solution/0800-0899/0824.Goat Latin/README_EN.md

@@ -6,16 +6,10 @@
 
 <p>A sentence <code>S</code> is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.</p>
 
-
-
 <p>We would like to convert the sentence to &quot;<em>Goat Latin&quot;</em>&nbsp;(a made-up language similar to Pig Latin.)</p>
 
-
-
 <p>The rules of Goat Latin are as follows:</p>
 
-
-
 <ul>
 	<li>If a word begins with a vowel (a, e, i, o, or u), append <code>&quot;ma&quot;</code>&nbsp;to the end of the word.<br />
 	For example, the word &#39;apple&#39; becomes &#39;applema&#39;.<br />
@@ -27,20 +21,12 @@
 	For example,&nbsp;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>
 
-
-
 <p>Return the&nbsp;final sentence representing the conversion from <code>S</code>&nbsp;to Goat&nbsp;Latin.&nbsp;</p>
 
-
-
 <p>&nbsp;</p>
 
-
-
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong>&quot;I speak Goat Latin&quot;
@@ -49,12 +35,8 @@
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong>&quot;The quick brown fox jumped over the lazy dog&quot;
@@ -63,37 +45,60 @@
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
-
-
 <p>Notes:</p>
 
-
-
 <ul>
 	<li><code>S</code> contains only uppercase, lowercase and spaces.&nbsp;Exactly one space between each word.</li>
 	<li><code>1 &lt;= S.length &lt;= 150</code>.</li>
 </ul>
 
-
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def toGoatLatin(self, sentence: str) -> str:
+        ans = []
+        for i, word in enumerate(sentence.split()):
+            if word.lower()[0] not in ['a', 'e', 'i', 'o', 'u']:
+                word = word[1:] + word[0]
+            word += 'ma'
+            word += 'a' * (i + 1)
+            ans.append(word)
+        return ' '.join(ans)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String toGoatLatin(String sentence) {
+        List<String> ans = new ArrayList<>();
+        Set<Character> vowels = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
+        int i = 1;
+        for (String word : sentence.split(" ")) {
+            StringBuilder t = new StringBuilder();
+            if (!vowels.contains(word.charAt(0))) {
+                t.append(word.substring(1));
+                t.append(word.charAt(0));
+            } else {
+                t.append(word);
+            }
+            t.append("ma");
+            for (int j = 0; j < i; ++j) {
+                t.append("a");
+            }
+            ++i;
+            ans.add(t.toString());
+        }
+        return String.join(" ", ans);
+    }
+}
 ```
 
 ### **...**

solution/0800-0899/0824.Goat Latin/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public String toGoatLatin(String sentence) {
+        List<String> ans = new ArrayList<>();
+        Set<Character> vowels = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
+        int i = 1;
+        for (String word : sentence.split(" ")) {
+            StringBuilder t = new StringBuilder();
+            if (!vowels.contains(word.charAt(0))) {
+                t.append(word.substring(1));
+                t.append(word.charAt(0));
+            } else {
+                t.append(word);
+            }
+            t.append("ma");
+            for (int j = 0; j < i; ++j) {
+                t.append("a");
+            }
+            ++i;
+            ans.add(t.toString());
+        }
+        return String.join(" ", ans);
+    }
+}

solution/0800-0899/0824.Goat Latin/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def toGoatLatin(self, sentence: str) -> str:
+        ans = []
+        for i, word in enumerate(sentence.split()):
+            if word.lower()[0] not in ['a', 'e', 'i', 'o', 'u']:
+                word = word[1:] + word[0]
+            word += 'ma'
+            word += 'a' * (i + 1)
+            ans.append(word)
+        return ' '.join(ans)