package ddd1;
import java.util.Scanner;
//在主方法中,输入10个数,保存在一个数组中,再输入一个数,
//定义一个方法在数组中查找这个数字,返回结果相关的信息,
//如果找到就在主方法中输出该数在数组中所处的位置,如果找不到就在主方法中输出“找不到”
public class d1 {
public static void main(String[] args) {
double[] shuzu = new double[5];
int[] xb = new int[shuzu.length];
Scanner smq = new Scanner(System.in);
System.out.println("分别输入5个数:");
for (int i = 0; i < shuzu.length; i++) {
shuzu[i] = smq.nextDouble();
}
System.out.println("请输入要查找的数字:");
double zhaoNum = smq.nextDouble();
int xiabiao=find(shuzu,zhaoNum,xb);
if(xiabiao!=-1) {
System.out.println("找到了,在数组中下标对应是:");
for (int i = 0; i < xb.length; i++) {
if(xb[i]!=-1) {
System.out.print(xb[i]+" ");
}
}
}else {
System.out.println("没找到");
}
}
private static int find(double[] shuzu, double zhaoNum, int[] xb) {
int xiabiao = -1;
for (int i = 0; i < shuzu.length; i++) {
if(zhaoNum == shuzu[i]) {
xiabiao = i;
xb[i] = i;
}else {
xb[i]=-1;
}
}
return xiabiao;
}
}