package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
# README
1052. Grumpy Bookstore Owner
Solution idea
Two Pointers: Sliding Window
- 吃了吐的情况分析:
- 吃进去1: 增加吃进去的值
- 吃进去0: 不变
- 吐出来1: 减去吐出去的值
- 吐出来0: 不变
面试时曾经有一道极为类似的题: 股票buy & sell, 选择 k consecutive days to sell, 求最大收益
prices = [3, 1, 2, 4]
algo = [0, 1, 1, 0] // 0-sell, 1-buy
k = 2
Time complexity = $O(n)$