249:移位字符串分组

src/main/java/leetcode/editor/cn/GroupShiftedStrings.java

@@ -0,0 +1,70 @@
+//给定一个字符串，对该字符串可以进行 “移位” 的操作，也就是将字符串中每个字母都变为其在字母表中后续的字母，比如："abc" -> "bcd"。这样，我们可
+//以持续进行 “移位” 操作，从而生成如下移位序列： 
+//
+// "abc" -> "bcd" -> ... -> "xyz" 
+//
+// 给定一个包含仅小写字母字符串的列表，将该列表中所有满足 “移位” 操作规律的组合进行分组并返回。 
+//
+// 
+//
+// 示例： 
+//
+// 输入：["abc", "bcd", "acef", "xyz", "az", "ba", "a", "z"]
+//输出：
+//[
+//  ["abc","bcd","xyz"],
+//  ["az","ba"],
+//  ["acef"],
+//  ["a","z"]
+//]
+//解释：可以认为字母表首尾相接，所以 'z' 的后续为 'a'，所以 ["az","ba"] 也满足 “移位” 操作规律。 
+// Related Topics 数组 哈希表 字符串 👍 57 👎 0
+
+package leetcode.editor.cn;
+
+import java.util.*;
+
+//249:移位字符串分组
+class GroupShiftedStrings {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new GroupShiftedStrings().new Solution();
+        solution.groupStrings(new String[]{"abc", "bcd", "acef", "xyz", "az", "ba", "a", "z"});
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public List<List<String>> groupStrings(String[] strings) {
+            Map<String, List<String>> map = new HashMap<>();
+            for (String s : strings) {
+                int sub = s.charAt(0) - 'a';
+                if (sub == 0) {
+                    List<String> list = map.getOrDefault(s, new ArrayList<>());
+                    list.add(s);
+                    map.put(s, new ArrayList<>(list));
+                    continue;
+                }
+                char[] chs = s.toCharArray();
+                chs[0] = 'a';
+                for (int i = 1; i < chs.length; i++) {
+                    chs[i] -= sub;
+                    if (chs[i] < 'a') {
+                        chs[i] += 26;
+                    }
+                }
+                String key = String.valueOf(chs);
+                List<String> list = map.getOrDefault(key, new ArrayList<>());
+                list.add(s);
+                map.put(key, new ArrayList<>(list));
+            }
+            List<List<String>> result = new ArrayList<>();
+            for (String key : map.keySet()) {
+                result.add(new ArrayList<>(map.get(key)));
+            }
+            return result;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

src/main/java/leetcode/editor/cn/doc/content/GroupShiftedStrings.md

@@ -0,0 +1,20 @@
+<p>给定一个字符串，对该字符串可以进行 &ldquo;移位&rdquo; 的操作，也就是将字符串中每个字母都变为其在字母表中后续的字母，比如：<code>&quot;abc&quot; -&gt; &quot;bcd&quot;</code>。这样，我们可以持续进行 &ldquo;移位&rdquo; 操作，从而生成如下移位序列：</p>
+
+<pre>&quot;abc&quot; -&gt; &quot;bcd&quot; -&gt; ... -&gt; &quot;xyz&quot;</pre>
+
+<p>给定一个包含仅小写字母字符串的列表，将该列表中所有满足&nbsp;&ldquo;移位&rdquo; 操作规律的组合进行分组并返回。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例：</strong></p>
+
+<pre><strong>输入：</strong><code>[&quot;abc&quot;, &quot;bcd&quot;, &quot;acef&quot;, &quot;xyz&quot;, &quot;az&quot;, &quot;ba&quot;, &quot;a&quot;, &quot;z&quot;]</code>
+<strong>输出：</strong>
+[
+  [&quot;abc&quot;,&quot;bcd&quot;,&quot;xyz&quot;],
+  [&quot;az&quot;,&quot;ba&quot;],
+  [&quot;acef&quot;],
+  [&quot;a&quot;,&quot;z&quot;]
+]
+<strong>解释：</strong>可以认为字母表首尾相接，所以 &#39;z&#39; 的后续为 &#39;a&#39;，所以 [&quot;az&quot;,&quot;ba&quot;] 也满足 &ldquo;移位&rdquo; 操作规律。</pre>
+<div><div>Related Topics</div><div><li>数组</li><li>哈希表</li><li>字符串</li></div></div><br><div><li>👍 57</li><li>👎 0</li></div>