We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Heap
  4. Jesse and Cookies
  5. Discussions

Jesse and Cookies

  • wshawn
     + 0 comments

    Python solution with heapq

    import heapq

def cookies(k, A):
    heapq.heapify(A)
    minVal = heapq.heappop(A)
    if minVal >= k: return 0
    
    heapq.heappush(A, minVal)
    count = 0
    while(len(A) >= 2):
        min1 = heapq.heappop(A)
        min2 = heapq.heappop(A)
        heapq.heappush(A, min1 + min2 * 2)
        count += 1
        minNew = heapq.heappop(A)
        if minNew >= k: return count
        heapq.heappush(A, minNew)
    return -1