LCP 18. 早餐组合

Posted 2021-05-20 lgz0921

题目链接：https://leetcode-cn.com/problems/2vYnGI/

思路：这个题的思路和https://leetcode-cn.com/problems/4xy4Wx/这个题的思路是一样的。详情请看https://blog.csdn.net/lgz0921/article/details/116654791，这里不再解释了，弄懂了上面这个题，此题就当作练手了~~~~

上代码：

class Solution {
    public int breakfastNumber(int[] staple, int[] drinks, int x) {
        int result = 0;
        Arrays.sort(staple);
        Arrays.sort(drinks);
        for (int i = 0, j = drinks.length - 1; i < staple.length && j >= 0; ) {
            if (staple[i] + drinks[j] <= x) {
                result += j + 1;
                i++;
            } else {
                j--;
            }
            result %= 1000000007;
        }
        return result;
    }
}