给定一个非负整数数组nums，你需要执行一系列操作，每次选择一个索引i（1≤i<n且nums[i]>0），将nums[i]减1，并将nums[i-1]加1。返回经过任意数量的操作后，数组nums的最大值的最小可能值。例如，对于数组[3,7,1,6]，经过最优操作后，最大值为5。"
45970819,908249,Apache Flink内存管理揭秘：操作Bits与Bytes的艺术,"['大数据', '实时计算', '批处理', '内存管理', '序列化']
You are given a 0-indexed array nums comprising of n non-negative integers.
In one operation, you must:
Choose an integer i such that 1 <= i < n and nums[i] > 0.
Decrease nums[i] by 1.
Increase nums[i - 1] by 1.
Return the minimum possible value of the maximum integer of nums after performing any number of operations.
Example 1:
Input: nums = [3,7,1,6]
Output: 5
Explanation:
One set of optimal operations is as follows:
- Choose i = 1, and nums becomes [4,6,1,6].
- Choose i = 3, and nums becomes [4,6,2,5].
- Choose i = 1, and nums becomes [5,5,2,5].
The maximum integer of nums is 5. It can be shown that the maximum number cannot be less than 5.
Therefore, we return 5.
Example 2:
Input: nums = [10,1]
Output: 10
Explanation:
It is optimal to leave nu
最低0.47元/天 解锁文章
扫一扫
260
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
