正如你在标题中看到的那样,我正在尝试编写一个程序,它为我解决了“Evening Standard Tube Quiz”。它的一部分。它必须能够找到地铁站名称中的字谜。我在互联网上发现了很多代码来检查两个单词是否是字谜。但我需要一些不同的东西:我想用伦敦所有地铁站的名称来喂养该程序,并给它一个字谜进行比较和检查,如果它适合其中一个电台名称。我怎么做?你在下面看到我的“比较两个单词”代码:
package anagram;
import java.util.Arrays;
public class anagram {
static void isAnagram(String str1, String str2) {
String s1 = str1.replaceAll("\\s", "");
String s2 = str2.replaceAll("\\s", "");
boolean status = true;
if (s1.length() != s2.length()) {
status = false;
} else {
char[] ArrayS1 = s1.toLowerCase().toCharArray();
char[] ArrayS2 = s2.toLowerCase().toCharArray();
Arrays.sort(ArrayS1);
Arrays.sort(ArrayS2);
status = Arrays.equals(ArrayS1, ArrayS2);
}
if (status) {
System.out.println(s1 + " and " + s2 + " are anagrams");
} else {
System.out.println(s1 + " and " + s2 + " are not anagrams");
}
}
public static void main(String[] args) {
isAnagram("Keep", "Peek");
isAnagram("Mother In Law", "Hitler Woman");
}
}
简单:
keep
- > eekp
)。Peek
- > eekp
)并在您的收藏中搜索。例:
public static String orderString(String candidate) {
char[] ccc = candidate
.replaceAll("[^\\p{IsAlphabetic}]", "")
.toLowerCase()
.toCharArray();
Arrays.sort(ccc);
return String.valueOf(ccc);
}
public static void main(String... args) {
Collection<String> tubeStations
= Arrays.asList("Acton Town",
"Acton Central", "Aldgate",
"Aldgate East", "Alperton",
"...");
Map<String, String> tubeMapAnagram = new java.util.LinkedHashMap<>();
for (String currCandidate: tubeStations) {
tubeMapAnagram.put(orderString(currCandidate), currCandidate);
}
String myCandidate = "Alpen Tor";
String foundOriginal = tubeMapAnagram.get(orderString(myCandidate));
if (foundOriginal!=null) {
System.out.println("anagram found for '"+foundOriginal+"'");
}
}
通过使用orderString()
方法,甚至可以使原始示例更简单。
boolean isAnagram(String str1, String str2) {
return Objects.equals(orderString(str1), orderString(str2));
}
你的代码工作。您是否需要一种方法将所有电台名称插入列表或什么?
public static void main(String[] args) {
String[] station = {"first", "second", "third", ..., "last"};
String check = "anagram";
for(int i=0; i < station.length(); i++){
isAnagram(station[i], check);
} }