Solving Grumpy Bookstore Owner in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Return the maximum number of customers that can be satisfied throughout the day.

Example 1:

Input: customers = [1,0,1,2,1,1,7,5], grumpy = [0,1,0,1,0,1,0,1], X = 3
Output: 16
Explanation: The bookstore owner keeps themselves not grumpy for the last 3 minutes. 
The maximum number of customers that can be satisfied = 1 + 1 + 1 + 1 + 7 + 5 = 16.

Note:

See the full details of the problem Grumpy Bookstore Owner at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go