The idea is from this post
https://hzhou.me/LeetCode/LeetCode-Group-Shifted-Strings.html
LeetCode: Group Shifted Strings
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:
1
|
"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"],
Return:
1
|
[
["abc","bcd","xyz"],
["az","ba"],
["acef"],
["a","z"]
]
|
Note: For the return value, each inner list’s elements must follow the lexicographic order.
The trick is how to divide different numbers, the author uses "#" to divide all the letters.
Cause we just need to record the relative number between neighboring alphit.
