首页 > 代码库 > LeetCode-Group Shifted Strings
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:
"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"]]
Solution:
public class Solution { public List<List<String>> groupStrings(String[] strings) { List<List<String>> resLists = new LinkedList<List<String>>(); HashMap<String,List<String>> patternMap = new HashMap<String,List<String>>(); for (String str : strings){ StringBuilder builder = new StringBuilder().append(str); int delta = builder.charAt(0)-‘a‘; builder.setCharAt(0,‘a‘); for (int i=1;i<builder.length();i++){ char c = (char) ((builder.charAt(i) + 26 - delta)%26); builder.setCharAt(i,c); } String pattern = builder.toString(); if (!patternMap.containsKey(pattern)){ patternMap.put(pattern,new LinkedList<String>()); } patternMap.get(pattern).add(str); } for (List<String> strList : patternMap.values()){ resLists.add(strList); } return resLists; }}
LeetCode-Group Shifted Strings
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。