leetcode-单调栈
leetcode-单调栈应用场景应用场景找出大于某个数的后一个数利用倒序遍历维护单调递减栈。public static void stack_02() { int[] nums = new int[]{1, 3, 4, 2}; int[] ret = new int[nums.length]; Arrays.fill(ret, -1); int[] stack = new int[nums.length]; int top = -1; for
原创
2021-04-04 09:38:17 ·
151 阅读 ·
0 评论