文章分类 - 单调栈
摘要：class Solution { public int findUnsortedSubarray(int[] nums) { Deque<Integer> stk = new LinkedList<>(); int n = nums.length; int left = n; for (int i
阅读全文
摘要：class Solution { public int maxChunksToSorted(int[] arr) { Deque<Integer> stk = new LinkedList<>(); int n = arr.length; for (int i = 0; i < n; i++) {
阅读全文
摘要：class Solution { public int[] nextGreaterElements(int[] nums) { int n = nums.length; int[] highRight = new int[n]; Deque<Integer> stk = new LinkedList
阅读全文
摘要：class Solution { public int[] nextGreaterElement(int[] nums1, int[] nums2) { int n = nums2.length; int[] highRight = new int[n]; Deque<Integer> stk =
阅读全文
摘要：class Solution { public int[] dailyTemperatures(int[] tem) { int n = tem.length; int[] res = new int[n]; // 维护了一个栈，栈中的元素是 t 后面的由按顺序且小到大序列[] Deque<Inte
阅读全文
摘要：class Solution { public int largestRectangleArea(int[] h) { int n = h.length; int[] left = new int[n]; int[] right = new int[n]; Deque<Integer> stk =
阅读全文
