蜡烛之间的盘子

// 思路：使用Java Stream API进行处理，我们可以通过stream的方式进行字符串的处理和数据的计算，但考虑到效率问题，主要逻辑不变。

import java.util.Arrays;

public int[] platesBetweenCandles(String s, int[][] queries) {
    int n = s.length();
    int[] leftCandle = new int[n];
    int[] rightCandle = new int[n];
    int[] platesCount = new int[n];
    int[] result = new int[queries.length];

    Arrays.fill(leftCandle, -1);
    Arrays.fill(rightCandle, -1);

    // Finding leftmost candles
    Arrays.stream(s.split(""))
          .forEachIndexed((i, c) -> {
              if (c.equals("|")) {
                  leftCandle[i] = i;
              } else if (i > 0) {
                  leftCandle[i] = leftCandle[i - 1];
              }
          });

    // Finding rightmost candles
    Arrays.stream(s.split(""))
          .collect(Collectors.toCollection(LinkedList::new))
          .descendingIterator()
          .forEachRemaining((c, i) -> {
              if (c.equals("|")) {
                  rightCandle[i] = i;
              } else if (i < n - 1) {
                  rightCandle[i] = rightCandle[i + 1];
              }
          });

    // Counting plates
    Arrays.stream(s.split(""))
          .forEachIndexed((i, c) -> {
              if (c.equals("*")) {
                  platesCount[i] = platesCount[i - 1] + 1;
              } else if (i > 0) {
                  platesCount[i] = platesCount[i - 1];
              }
          });

    // Calculating results
    for (int i = 0; i < queries.length; i++) {
        int leftIndex = rightCandle[queries[i][0]];
        int rightIndex = leftCandle[queries[i][1]];
        if (leftIndex != -1 && rightIndex != -1 && leftIndex <= rightIndex) {
            result[i] = platesCount[rightIndex] - platesCount[leftIndex];
        }
    }

    return result;
}