1. There are N empty glasses with a capacity of 1, 2, ..., N liters (there is exactly one glass of each unique capacity). You want to pour exactly K liters of water into glasses. Each glass may be either full or empty (a glass cannot be partially filled).
What is the minimum number of glasses that you need to contain K liters of water?
Write a function:
function:
class Solution & public int solution(int|] A); )
that, given an array A of N integers, returns the maximum sum of numbers that can be covered using at most three tiles.
匿名用户-KAJ6X
2025-9-22 18:36:43
收藏
淘帖
好苗
杂草
匿名用户-IWWT1
提升卡
置顶卡
关贴卡
开贴卡
变色卡
千斤顶
