Monotonic Stack
文章平均质量分 86
WaterlooAss
这个作者很懒,什么都没留下…
展开
-
Maximum Number of Books You Can Take
就像arr[2] = 4, arr[3] = 8, arr[4] = 6. 就算我们arr[4] 取6, arr[3] 取 5, arr[2] 取4. dp[2] 原先算出来的结果就是假设arr[2] 取4. 所以可以直接dp[4] = dp[2] + 5(arr[3]取值) + 6(arr[4] 取值)dp[3] = dp[2] + 8 = , dp[4] = dp[1] + 4 + 5+ 6 (其实= dp[2] + 5 + 6)原创 2022-12-20 10:18:33 · 65 阅读 · 0 评论 -
Sum of Subarray Minimums
class Solution { public int sumSubarrayMins(int[] arr) { int MOD = 1000000007; Stack stack = new Stack(); long sumOfMinimums = 0; // building monotonically increasing stack for (int i = 0; i原创 2022-10-24 06:23:56 · 128 阅读 · 0 评论