【模板总结】单调栈

最新推荐文章于 2024-09-28 22:05:59 发布

bijian0530

最新推荐文章于 2024-09-28 22:05:59 发布

阅读量81

点赞数

文章标签：算法 leetcode java

本文链接：https://blog.csdn.net/bijian0530/article/details/125855510

版权

1856. 子数组最小乘积的最大值

在这里插入图片描述

   public static int maxSumMinProduct(int[] nums) {
      int N = nums.length;
      long[] sum = new long[N];
      sum[0] = nums[0];
      for (int i = 1; i < N; i++) {
         sum[i] = nums[i] + sum[i - 1];
      }
      long ans = 0;
      LinkedList<Integer> stack = new LinkedList<>();
      for (int i = 0; i < N; i++) {
         while(stack.size() > 0 && nums[stack.peek()] >= nums[i]){
            int j = stack.pop();
            if(stack.size() == 0){
               ans = Math.max(ans, sum[i - 1] * nums[j]);
            }else{
               ans = Math.max(ans, (sum[i - 1] - sum[stack.peek()]) * nums[j] );
            }
         }
         stack.push(i);
      }
      while(stack.size() > 0){
         int j = stack.pop();
         if(stack.size() > 0){
            ans = Math.max(ans, (sum[N - 1] - sum[stack.peek()]) * nums[j]);
         }else{
            ans = Math.max(ans, sum[N - 1] * nums[j]);
         }
      }
      long mod = (long)1e9 + 7;
      return (int) (ans % mod);
   }

# 面试题 17.21. 直方图的水量

在这里插入图片描述

   public int trap(int[] height) {
      Stack<Integer> stack = new Stack<>();
      if(height == null || height.length < 3){
         return 0;
      }
      int ans = 0;
      for (int i = 0; i < height.length; i++) {
         while (stack.size() > 0 && height[stack.peek()] <= height[i]){
            int popNum = stack.pop();
            if(stack.size() > 0){
               int h = Math.min(height[i] - height[popNum], height[stack.peek()] - height[popNum]);
               int l = i - stack.peek() - 1;
               ans += h * l;
            }
         }
         stack.push(i);
      }
      return ans;
   }

剑指 Offer II 039. 直方图最大矩形面积

在这里插入图片描述

   public int largestRectangleArea(int[] heights) {
      int ans = 0;
      int N = heights.length;
      Stack<Integer> stack = new Stack<>();
      for (int i = 0; i < heights.length; i++) {
         while(stack.size() > 0 && heights[stack.peek()] >= heights[i]){
            int popNum = stack.pop();
            int k = stack.size() == 0 ? -1 : stack.peek();
            int l = i - k - 1;
            ans = Math.max(ans, heights[popNum] * l);
         }
         stack.push(i);
      }
      while(stack.size() > 0){
         int popNum = stack.pop();
         int k = stack.size() == 0 ? -1 : stack.peek();
         int l = N - k - 1;
         ans = Math.max(ans, heights[popNum] * l);
      }
      return ans;
   }

剑指 Offer II 040. 矩阵中最大的矩形

在这里插入图片描述

   public int maximalRectangle(String[] matrix) {
      int ans = 0;
      if(matrix == null || matrix.length == 0 || matrix[0].length() == 0){
         return 0;
      }
      int[] height = new int[matrix[0].length()];
      for (int i = 0; i < matrix.length; i++) {
         String s = matrix[i];
         for (int j = 0; j < s.length(); j++) {
            height[j] = s.charAt(j) == '0' ? 0 : height[j] + 1;
         }
         ans = Math.max(ans, process(height));
      }
      return ans;
   }

   private int process(int[] height) {
      Stack<Integer> stack = new Stack<>();
      int N = height.length;
      int ans = 0;
      for (int i = 0; i < height.length; i++) {
         while(stack.size() > 0 && height[stack.peek()] >= height[i]){
            int popNum = stack.pop();
            int k = stack.size() == 0 ? -1 : stack.peek();
            int l = i - k - 1;
            ans = Math.max(ans, l * height[popNum]);
         }
         stack.push(i);
      }
      while(stack.size() > 0){
         int popNum = stack.pop();
         int k = stack.size() == 0 ? -1 : stack.peek();
         int l = N - k - 1;
         ans = Math.max(ans, height[popNum] * l);
      }
      return ans;
   }