你能在你最喜欢的那天吃到你最喜欢的糖果吗？（Java算法每日一题）六一快乐~

问：
原题链接：你能在你最喜欢的那天吃到你最喜欢的糖果吗？

答：

class Solution {
    public boolean[] canEat(int[] candiesCount, int[][] queries) {
        int len1 = candiesCount.length;
        int len2 = queries.length;
        boolean[] str = new boolean[len2];
        long[] sum = new long[len1+1];
        for(int i = 1;i <= len1;i++)
        {
            sum[i] = sum[i-1] + candiesCount[i-1];
        }
        for(int i = 0;i < len2;i++)
        {
            int t = queries[i][0];
            int d = queries[i][1] + 1;
            int c = queries[i][2];
            long a = sum[t] / c + 1;
            long b = sum[t+1];
            str[i] = a<=d&&d<=b;
        }
        return str;
    }
}