LeetCode--LCP 18. 早餐组合

public static int breakfastnumber(int[] arr_staple, int[] arr_drink, int x){ int res = 0; for(int staple_val : arr_staple){ for(int drink_val : arr_drink){ if((staple_val + drink_val) <= x){ res++; } } } return res; }