NiuNiu MaTe

Sep 15, 2021 · Fundamentals

How to Maximize Mooncake Profit: Brute Force, Greedy, and DP Solutions

This article presents a classic stock‑like profit maximization problem using mooncake prices, explains the input and expected output, and walks through three solution strategies—brute‑force enumeration, a greedy linear scan, and a dynamic‑programming approach—complete with Go code examples and visual illustrations.