关键词搜索并行数组

Question

你好，我正在尝试编写关键字搜索parralele数组的代码，我有2个数组

    String[] beerNames = new String[10]; //define berrNames array
    Double[] beerStrengths = new Double[10]; //define beerStrengths array        

    beerNames[0] = "Heineken"; //fill the arrays
    beerNames[1] = "Bud Light";
    beerNames[2] = "Coors Light";
    beerNames[3] = "Leffe Blonde";
    beerNames[4] = "Budweiser";
    beerNames[5] = "Erdinger Non-Alcoholic";
    beerNames[6] = "Bud Premier Select";
    beerNames[7] = "Corona";
    beerNames[8] = "Barefoot Bohemian";
    beerNames[9] = "3 Monts";

    beerStrengths[0] = 4.0;
    beerStrengths[1] = 4.2;
    beerStrengths[2] = 4.3;
    beerStrengths[3] = 6.6;
    beerStrengths[4] = 5.0;
    beerStrengths[5] = 0.0;
    beerStrengths[6] = 7.4;
    beerStrengths[7] = 4.6;
    beerStrengths[8] = 4.0;
    beerStrengths[9] = 8.5; //fill the arrays

我想能够搜索关键字，所以如果我输入巴德，我会得到一个结果

“芽之光”的酒精度为4.2%“百威”的酒精度为5.0%

可悲的是，我不知道如何做到这一点，我一直在看一些代码，我从搜索文件扫描器console=new Scanner（system.in）；system.out.print（“搜索短语：”）；字符串搜索=Console.NextLine().ToLowerCase（）；

    Scanner input = new Scanner(new File("imdb.txt"));
    // 1 9.1 243153 The Godfather (1972)

    while (input.hasNextLine()) {
        String line = input.nextLine();
        if (line.toLowerCase().contains(search)) {
            //System.out.println(line);
            displayMovieInfo(line);
        }
    }
}

public static void displayMovieInfo(String line) {
    Scanner lineScan = new Scanner(line);
    int rank = lineScan.nextInt();
    double rating = lineScan.nextDouble();
    lineScan.nextInt();

    String title = "";
    while (lineScan.hasNext()) {
        title = title + lineScan.next() + " ";
    }
    System.out.println(rank + "\t" + rating + "\t" + title);
}

但我不知道如何转换这段代码，如果您能提供帮助，我将不胜感激

Answer 1

如果知道第一个数组的数组索引，那么就知道第二个数组的索引。这听起来也像是创建具有两个属性的对象的候选者：

public class BeerStrength  {
   private final String name;
   private final int strengthNum;
   public BeerStrength(String name, int strength_num)  {
      this.name = name;
      strengthNum = strength_num;
   }
   public String getName()  {
      return  name;
   }
   public int getStrength()  {
      return  strengthNum;
   }
}

那么您就有一个beerstength数组，这将使并行数组问题变得没有意义。