zhmq_top的博客

题目描述 public class Solution { public static String[] findOcurrences(String text, String first, String second) { String[] words = text.split(" ");// 先拆成单个单词 List<String> an = new ArrayList<>(); int n = 0; for (int i = 0; i < words.le

题目描述 考查：二叉树的层次遍历 package year2021.month12.day25; import java.util.ArrayDeque; import java.util.LinkedList; import java.util.Queue; class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() { } TreeNode(int val) { this.val = val; }

题目：吃苹果的最大数目 Java代码 public class Solution { public int eatenApples(int[] apples, int[] days) { int maxDay = 0; // 找出苹果还未全部腐烂的最后日期,maxDay for (int i = 0; i < days.length; i++) { maxDay = Math.max(i + days[i], maxDay); } // 下标值表示失效日期，存储"在当天后