refactor 824

fishercoder1534 · fishercoder1534 · commit defd006023e9 · 2020-07-23T10:37:57.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_824.java b/src/main/java/com/fishercoder/solutions/_824.java
@@ -4,71 +4,36 @@
 import java.util.HashSet;
 import java.util.Set;
 
-/**
- * 824. 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.
- *
- * Example 1:
- *
- * Input: "I speak Goat Latin"
- * Output: "Imaa peaksmaaa oatGmaaaa atinLmaaaaa"
- *
- * Example 2:
- *
- * Input: "The quick brown fox jumped over the lazy dog"
- * Output: "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"
- *
- * Notes:
- *
- *     S contains only uppercase, lowercase and spaces. Exactly one space between each word.
- *     1 <= S.length <= 100.
- */
 public class _824 {
 
-  public static class Solution1 {
-    public String toGoatLatin(String S) {
-      StringBuilder sb = new StringBuilder();
-      Set<Character> vowels =
-          new HashSet(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
-      String[] words = S.split(" ");
-      for (int i = 0; i < words.length; i++) {
-        if (vowels.contains(words[i].charAt(0))) {
-          String newWord = words[i] + "ma";
-          int j = i + 1;
-          while (j-- > 0) {
-            newWord += 'a';
-          }
-          sb.append(newWord);
-          sb.append(" ");
-        } else {
-          StringBuilder subSb = new StringBuilder(words[i].substring(1));
-          subSb.append(words[i].charAt(0));
-          subSb.append("ma");
-          int j = i + 1;
-          while (j-- > 0) {
-            subSb.append("a");
-          }
-          sb.append(subSb.toString());
-          sb.append(" ");
+    public static class Solution1 {
+        public String toGoatLatin(String S) {
+            StringBuilder sb = new StringBuilder();
+            Set<Character> vowels =
+                    new HashSet(Arrays.asList('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'));
+            String[] words = S.split(" ");
+            for (int i = 0; i < words.length; i++) {
+                if (vowels.contains(words[i].charAt(0))) {
+                    String newWord = words[i] + "ma";
+                    int j = i + 1;
+                    while (j-- > 0) {
+                        newWord += 'a';
+                    }
+                    sb.append(newWord);
+                    sb.append(" ");
+                } else {
+                    StringBuilder subSb = new StringBuilder(words[i].substring(1));
+                    subSb.append(words[i].charAt(0));
+                    subSb.append("ma");
+                    int j = i + 1;
+                    while (j-- > 0) {
+                        subSb.append("a");
+                    }
+                    sb.append(subSb.toString());
+                    sb.append(" ");
+                }
+            }
+            return sb.substring(0, sb.length() - 1);
         }
-      }
-      return sb.substring(0, sb.length() - 1);
     }
-  }
 }
