LeetCode每日一题(2226. Maximum Candies Allocated to K Children)

最新推荐文章于 2024-09-18 16:48:36 发布

wangjun861205

最新推荐文章于 2024-09-18 16:48:36 发布

阅读量396

点赞数

分类专栏：算法数据结构文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/wangjun861205/article/details/127413064

版权

给定一个表示糖果堆大小的整数数组 candies 和一个整数 k，你需要将糖果分配给 k 个孩子，使得每个孩子获得相同数量的糖果。每个糖果堆可以分成任意多个子堆，但不能合并两个堆。目标是最大化每个孩子能获得的糖果数量。二分查找法可以用于解决这个问题，开始时最小值为 0，最大值为最大糖果堆的数量，通过不断调整边界找到可行的最大糖果数。

摘要由CSDN通过智能技术生成

You are given a 0-indexed integer array candies. Each element in the array denotes a pile of candies of size candies[i]. You can divide each pile into any number of sub piles, but you cannot merge two piles together.

You are also given an integer k. You should allocate piles of candies to k children such that each child gets the same number of candies. Each child can take at most one pile of candies and some piles of candies may go unused.

Return the maximum number of candies each child can get.

Example 1:

Input: candies = [5,8,6], k = 3
Output: 5

Explanation: We can divide candies[1] into 2 piles of size 5 and 3, and candies[2] into 2 piles of size 5 and 1. We now have five piles of candies of sizes 5, 5, 3, 5, and 1. We can allocate the 3 piles of size 5 to 3 children. It can be proven that each child cannot receive more than 5 candies.

Example 2:

Input: candies = [2,5], k = 11
Output: 0

Explanation: There are 11 children but only 7 candies in total, so it is impossible to ensure each child receives at least one candy. Thus, each child gets no candy and the answer is 0.

Constraints: