refactor 249

fishercoder1534 · fishercoder1534 · commit 162ce35142b2 · 2018-10-25T08:03:13.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_249.java b/src/main/java/com/fishercoder/solutions/_249.java
@@ -5,49 +5,35 @@
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
-/**Given a string, we can "shift" each of its letter to its successive letter, for example: "abc" -> "bcd". We can keep "shifting" which forms the sequence:
 
- "abc" -> "bcd" -> ... -> "xyz"
- Given a list of strings which contains only lowercase alphabets, group all strings that belong to the same shifting sequence.
-
- For example, given: ["abc", "bcd", "acef", "xyz", "az", "ba", "a", "z"],
- A solution is:
-
- [
- ["abc","bcd","xyz"],
- ["az","ba"],
- ["acef"],
- ["a","z"]
- ]
-
- */
 public class _249 {
 
-    public List<List<String>> groupStrings(String[] strings) {
+    public static class Solution1 {
+        public List<List<String>> groupStrings(String[] strings) {
+
+            List<List<String>> result = new ArrayList<List<String>>();
+            Map<String, List<String>> map = new HashMap<String, List<String>>();
 
-        List<List<String>> result = new ArrayList<List<String>>();
-        Map<String, List<String>> map = new HashMap<String, List<String>>();
+            for (String word : strings) {
+                String key = "";
+                int offset = word.charAt(0) - 'a';
+                for (int i = 1; i < word.length(); i++) {
+                    key += (word.charAt(i) - offset + 26) % 26;
+                }
 
-        for (String word : strings) {
-            String key = "";
-            int offset = word.charAt(0) - 'a';
-            for (int i = 1; i < word.length(); i++) {
-                key += (word.charAt(i) - offset + 26) % 26;
+                if (!map.containsKey(key)) {
+                    map.put(key, new ArrayList<>());
+                }
+                map.get(key).add(word);
             }
 
-            if (!map.containsKey(key)) {
-                map.put(key, new ArrayList<>());
+            for (List<String> list : map.values()) {
+                Collections.sort(list);
+                result.add(list);
             }
-            map.get(key).add(word);
-        }
 
-        for (List<String> list : map.values()) {
-            Collections.sort(list);
-            result.add(list);
+            return result;
         }
-
-        return result;
-
     }
 
 }
