LeetCode 249. Group Shifted Strings

原题网址：https://leetcode.com/problems/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:

"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:

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

Note: For the return value, each inner list's elements must follow the lexicographic order.

思路：以字符串第一个字符为基准，将字符串标准化为小写字母a开头的字符串。

public class Solution {
    public List<List<String>> groupStrings(String[] strings) {
        Arrays.sort(strings);
        Map<String, List<String>> map = new HashMap<>();
        for(int i=0; i<strings.length; i++) {
            char[] sa = strings[i].toCharArray();
            if (sa.length > 0) {
                int adjust = sa[0]-'a';
                for(int j=0; j<sa.length; j++) sa[j] = (char)((sa[j] - 'a' - adjust + 26) % 26 + 'a');
            }
            String key = new String(sa);
            List<String> list = map.get(key);
            if (list == null) {
                list = new ArrayList<>();
                map.put(key, list);
            }
            list.add(strings[i]);
        }
        List<List<String>> results = new ArrayList<>();
        results.addAll(map.values());
        return results;
    }
}