zoukankan      html  css  js  c++  java
  • [LeetCode] 875. Koko Eating Bananas 可可吃香蕉

    Koko loves to eat bananas.  There are N piles of bananas, the i-th pile has piles[i] bananas.  The guards have gone and will come back in H hours.

    Koko can decide her bananas-per-hour eating speed of K.  Each hour, she chooses some pile of bananas, and eats K bananas from that pile.  If the pile has less than K bananas, she eats all of them instead, and won't eat any more bananas during this hour.

    Koko likes to eat slowly, but still wants to finish eating all the bananas before the guards come back.

    Return the minimum integer K such that she can eat all the bananas within H hours.

    Example 1:

    Input: piles = [3,6,7,11], H = 8
    Output: 4
    

    Example 2:

    Input: piles = [30,11,23,4,20], H = 5
    Output: 30
    

    Example 3:

    Input: piles = [30,11,23,4,20], H = 6
    Output: 23
    

    Note:

    • 1 <= piles.length <= 10^4
    • piles.length <= H <= 10^9
    • 1 <= piles[i] <= 10^9

    Python:

    class Solution(object):
        def minEatingSpeed(self, piles, H):
            """
            :type piles: List[int]
            :type H: int
            :rtype: int
            """
            tryEat = lambda s: sum(int(math.ceil(1.0 * p / s)) for p in piles)
            left, right = 1, sum(piles)
            while left <= right:
                mid = (left + right) / 2
                if tryEat(mid) <= H: right = mid - 1
                else: left = mid + 1
            return left 

    Python: wo

    class Solution():
        def eatBananas(self, piles, H):
            piles = sorted(piles)
            k = piles[-1]
            res = float('Inf')
            while k > 0:
                t = H
                for pile in piles:
                    if pile <= k:
                        t -= 1
                    else:
                        if pile % k == 0:
                            t -= pile / k
                        else:
                            t -= pile / k + 1
                if t == 0:
                    res = min(res, k)
                k -= 1
            return res
    

      

    All LeetCode Questions List 题目汇总

  • 相关阅读:
    SRS之SrsRtmpConn::service_cycle详解
    SRS之SrsRtmpServer::connect_app详解
    SRS之RTMP连接处理线程conn:接收客户端推流
    SRS之RTMP handshake
    SRS之RTMP的TCP线程(即监听线程)
    CSPS模拟 77
    CSPS模拟 76
    CSPS模拟 75
    CSPS模拟 74
    CSPS模拟 73
  • 原文地址:https://www.cnblogs.com/lightwindy/p/9560077.html
Copyright © 2011-2022 走看看