int[] — dimension sizes
* 核心思路：链表转数组 + 单调栈（从后往前遍历），时间复杂度O(n)，空间复杂度O(n)
，更多细节参见新收录的资料
Easy-to-use app available on all major devices including iPhone, Android, Windows, Mac, and more
关键节奏：先帮忙 → 帮不了再补偿 → 补偿成功才允许阻塞 → 醒来后恢复。
Precompiled Headers (PCH) are mandatory for