当我键入数组列表中没有的内容时,"Name不匹配“将打印5次。我只想把这个印一次。
public class Arrays {
public static void main(String[] args) {
String[] names = {"Meisam", "Raju", "Sasi", "Aju", "Ram"};
int[] numbers = {123456, 654321, 345678, 953456, 123445};
for (int i = 0; i < names.length; i++) {
System.out.println(names[i]);
}
System.out.println("Please Enter a Name: ");
Scanner scanner = new Scanner(System.in);
String name = scanner.next();
for(int i = 0; i < names.length; i++){
if(name.equals(names[i])) {
System.out.println(numbers[i]);
} else {
System.out.println("Names Doesn't Match!");
}
}
}
}产出如下:
Meisam
Raju
Sasi
Aju
Ram
Please Enter a Name:
raj //input a keyword called 'raj'
Names Doesn't Match!
Names Doesn't Match!
Names Doesn't Match!
Names Doesn't Match!
Names Doesn't Match!发布于 2020-09-30 06:58:15
哪一行代码要打印5次“名称不匹配”?
for(int i = 0; i < names.length; i++) {
// ...
}它将为数组中的每个元素打印Names Doesn't Match!。如果数组包含例如10个元素,那么您将看到10次此消息。
如何只打印一次“名称不匹配”?
只需首先检查整个数组,并设置名称是否找到的a marker。只有在此之后,如果是maker is false,则打印消息。
int j = -1; // j == -1 -> means NOT_FOUND
for (int i = 0; i < name.length(); i++) {
if (name.equals(names[i])) {
j = i;
break;
}
}
System.out.println(j == -1 ? "Names Doesn't Match!" : numbers[j]);我认为最好在这个问题上使用Map:
public static void main(String... args) {
Map<String, Integer> nameNumber = Map.of(
"Meisam", 123456,
"Raju", 654321,
"Sasi", 345678,
"Aju", 953456,
"Ram", 123445);
nameNumber.keySet().forEach(System.out::println);
System.out.print("Please Enter a Name: ");
String name = new Scanner(System.in).next();
Integer number = nameNumber.get(name);
System.out.println(number == null ? "Names Doesn't Match!" : number);
}发布于 2020-09-30 06:51:47
更改您的代码以设置一个布尔值,并在循环之后对其进行计算。
而且,一旦找到循环,就可以从循环中脱离出来。
boolean found = false;
for(int i = 0; i < names.length; i++){
if(name.equals(names[i])) {
System.out.println(numbers[i]);
found = true;
break;
}
}
if (!found){
System.out.println("Names Doesn't Match!");
}发布于 2020-09-30 06:59:32
删除for循环中的其他部分添加System.exit(0);在for循环中if-块内部的最后一行添加System.out.println(“名称不匹配!”);在for循环之后
https://stackoverflow.com/questions/64132209
复制相似问题