mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 09:59:41 +01:00
30 lines
666 B
Go
30 lines
666 B
Go
|
package main
|
||
|
|
||
|
func maxSatisfied(customers []int, grumpy []int, minutes int) int {
|
||
|
// count always satisfied customers
|
||
|
satisfied := 0
|
||
|
for i, count := range customers {
|
||
|
satisfied += count * (1 - grumpy[i])
|
||
|
}
|
||
|
|
||
|
// get the initial run
|
||
|
unsatisfied := 0
|
||
|
for i := 0; i < minutes; i++ {
|
||
|
unsatisfied += customers[i] * grumpy[i]
|
||
|
}
|
||
|
|
||
|
maxCoverage := unsatisfied
|
||
|
for i := minutes; i < len(customers); i++ {
|
||
|
// remove from the start
|
||
|
unsatisfied -= customers[i-minutes] * grumpy[i-minutes]
|
||
|
|
||
|
// add from the end
|
||
|
unsatisfied += customers[i] * grumpy[i]
|
||
|
|
||
|
// update max coverage
|
||
|
maxCoverage = max(maxCoverage, unsatisfied)
|
||
|
}
|
||
|
|
||
|
return maxCoverage + satisfied
|
||
|
}
|