代码拉取完成,页面将自动刷新
public class searchQueue{
//使用二维数组表示有向图
static String[] graphName = {"you","alice","bob","claire","anuj","peggy","thom","jonny"};
static String[][] graph = {
{"you","alice"},
{"you","bob"},
{"you","claire"},
{"bob","anuj"},
{"bob","peggy"},
{"alice","peggy"},
{"claire","thom"},
{"claire","jonny"},
};
public static boolean Search(String name){
Queue<String> searchQueue = new LinkedList<>();
Queue<String> searched = new LinkedList<>();
for (int i = 0; i < graphName.length; i++)
searchQueue.add(graphName[i]);
while (!searchQueue.isEmpty()) {
String person = searchQueue.poll();
if(!searched.contains(person)) {
if(personIsSeller(person)) {
System.out.println(person + " is a mango seller!");
return true;
}else {
for (int i = 0; i < graph.length; i++) {
if (graph[i][0].equals(person))
searchQueue.add(graph[i][1]);
}
searched.add(person);
}
}
}
return false;
}
public static boolean personIsSeller(String name){
return name.charAt(name.length()-1) == 'm';
}
public static void main(String[] args) {
System.out.println(Search("you"));
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。