249. Group Shifted Strings

最新推荐文章于 2025-07-05 01:17:14 发布

原创最新推荐文章于 2025-07-05 01:17:14 发布 · 466 阅读

9 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #leetcode

249. Group Shifted Strings

Perform the following shift operations on a string:

Right shift: Replace every letter with the successive letter of the English alphabet, where 'z' is replaced by 'a'. For example, "abc" can be right-shifted to "bcd" or "xyz" can be right-shifted to "yza".
Left shift: Replace every letter with the preceding letter of the English alphabet, where 'a' is replaced by 'z'. For example, "bcd" can be left-shifted to "abc" or "yza" can be left-shifted to "xyz".

We can keep shifting the string in both directions to form an endless shifting sequence.

For example, shift "abc" to form the sequence: ... <-> "abc" <-> "bcd" <-> ... <-> "xyz" <-> "yza" <-> .... <-> "zab" <-> "abc" <-> ...

You are given an array of strings strings, group together all strings[i] that belong to the same shifting sequence. You may return the answer in any order.

Example 1:

Input: strings = ["abc","bcd","acef","xyz","az","ba","a","z"]

Output: [["acef"],["a","z"],["abc","bcd","xyz"],["az","ba"]]

Example 2:

Input: strings = ["a"]

Output: [["a"]]

Constraints:

1 <= strings.length <= 200
1 <= strings[i].length <= 50
strings[i] consists of lowercase English letters.

class Solution:
    def groupStrings(self, strings: List[str]) -> List[List[str]]:
        mydict=defaultdict(list)

        for s in strings:
            if len(s)==1:
                mydict[()].append(s)
            else:
                char_diff=()
                for i in range(len(s)-1):
                    d=26+ord(s[i+1])-ord(s[i])
                    char_diff+=(d%26,)
                mydict[char_diff].append(s)
        return mydict.values()

hash the diff