파비의 매일매일 공부기록

2023.04.05 Today's Challenge 본문

Problem Solving/LeetCode

2023.04.05 Today's Challenge

fabichoi 2023. 4. 5. 23:45

https://leetcode.com/problems/minimize-maximum-of-array/

 

Minimize Maximum of Array - LeetCode

Can you solve this real interview question? Minimize Maximum of Array - 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] b

leetcode.com

탐욕법의 다른 활용 예

class Solution:
    def minimizeArrayValue(self, nums: List[int]) -> int:
        answer, ps = 0, 0

        for i in range(len(nums)):
            ps += nums[i]
            answer = max(answer, math.ceil(ps / (i+1)))
        
        return answer
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.04.07 Today's Challenge  (0) 2023.04.07
2023.04.06 Today's Challenge  (0) 2023.04.06
2023.04.04 Today's Challenge  (0) 2023.04.04
2023.04.03 Today's Challenge  (0) 2023.04.03
2023.04.02 Today's Challenge  (0) 2023.04.02
'Problem Solving/LeetCode' Related Articles more
Comments