2021.9某度笔试题-CSDN博客

本文链接：https://blog.csdn.net/m0_37302219/article/details/120173228

这篇博客介绍了如何使用Java实现一个名为findEasy的方法，用于在一个字符串中查找特定字符出现的子串数量，重点关注了'easy'字符的查找过程。通过多个辅助函数如findE、findA、findS和findY，展示了字符串处理技巧。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public class Main {

  static void main() {
    Scanner scanner = new Scanner(System.in);
    while (scanner.hasNext()) {
      String s = scanner.next();
      int res = findEasy(s);
      System.out.println(res);
    }
  }

  static int findEasy(String s) {
    String lowerS = s.toLowerCase();
    char[] chars = lowerS.toCharArray();
    int index = 0;
    int count = 0;
    while (index < chars.length) {
      index = findEasy(chars, index);
      if (index <= chars.length) {
        ++count;
      }
      ++index;
    }
    return count;
  }

  static int findEasy(char[] chars, int i) {
    int index = findE(chars, i);
    if (index >= chars.length) {
      return chars.length+1;
    }
    index = findA(chars, index);
    if (index >= chars.length) {
      return chars.length+1;
    }
    index = findS(chars, index);
    if (index >= chars.length) {
      return chars.length+1;
    }
    index = findY(chars, index);
    if (index >= chars.length) {
      return chars.length+1;
    }
    return index;
  }

  static int findE(char[] chars, int i) {
    for (int j = i; j < chars.length; j++) {
      if (chars[j] == 'e') {
        return j + 1;
      }
    }
    return chars.length;
  }

  static int findA(char[] chars, int i) {
    for (int j = i; j < chars.length; j++) {
      if (chars[j] == 'a') {
        return j + 1;
      }
    }
    return chars.length;
  }

  static int findS(char[] chars, int i) {
    for (int j = i; j < chars.length; j++) {
      if (chars[j] == 's') {
        return j + 1;
      }
    }
    return chars.length;
  }

  static int findY(char[] chars, int i) {
    for (int j = i; j < chars.length; j++) {
      if (chars[j] == 'y') {
        return j;
      }
    }
    return chars.length;
  }
}