🥈

Koko Eating Bananas

Created

2022/01/21 01:26

문제 번호

875

카테고리

Array

Binary Search

Koko Eating Bananas - LeetCode

Koko loves to eat bananas. There are n piles of bananas, the 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.

https://leetcode.com/problems/koko-eating-bananas/

Code

제출 날짜	시간	메모리
2021/01/20	16 ms	6.6 MB

// 875. Koko Eating Bananas
//
// https://leetcode.com/problems/koko-eating-bananas/

// math package has been imported to call Ceil.
// sort package has been imported to call Search for Binary Search.
import (
	"math"
	"sort"
)

// minEatingSpeed function finds the minimum portion to eat bananas in h hours.
// Parametric search has been used and this is done by Search function of sort package.
func minEatingSpeed(piles []int, h int) int {
	max := 0
	for _, p := range piles {
		if max < p {
			max = p
		}
	}
	k := sort.Search(max, func(x int) bool {
		if x == 0 {
			return len(piles) == 0
		}
		sum := 0
		for _, p := range piles {
			sum += int(math.Ceil(float64(p) / float64(x)))
		}
		return sum <= h
	})
	return k
}
Go
복사