摘要：题目解答在为负数的时候，当经过的时候，数值大小会很大得反转
题目：
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 List> groupStrings(String[] strings) {
List> result = new ArrayList>();
Map> map = new HashMap>();
for (String str : strings) {
String key = "";
for (int i = 1; i < str.length(); i++) {
int offset = str.charAt(i) - str.charAt(i - 1);
//在为负数的时候，当经过z, a的时候，数值大小会很大得反转
key += offset < 0 ? offset + 26 : offset;
}
if (!map.containsKey(key)) map.put(key, new ArrayList());
map.get(key).add(str);
}
for (List list : map.values()) {
result.add(list);
}
return result;
}
文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。
转载请注明本文地址：https://www.ucloud.cn/yun/64875.html
