题解 | #牛牛的草量问题#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param grass int整型一维数组
     * @param eatenGrass int整型
     * @return bool布尔型一维数组
     */
    public boolean[] minGrassAmount (int[] grass, int eatenGrass) {
        int minGrass = grass[0];
        for (int i = 1; i < grass.length ; i++) {
            minGrass = Math.min(minGrass, grass[i]);
        }
        boolean [] result = new boolean[grass.length];
        for (int i = 0; i < grass.length; i++) {
            if (grass[i] - eatenGrass <= 0 || grass[i] - eatenGrass <= minGrass) {
                result[i] = true;
            } else {
                result[i] = false;
            }
        }
        return result;
    }
}

本题知识点分析：

1.数组遍历

2.数学模拟

本题解题思路分析：

1.先找到最小值的草

2.然后遍历所有grass,如果-eat<=0或者-eat<=minGrass都为true,否则为false

3.返回result数组

本题使用编程语言: Java