算法之-栈区间最大值

          算法之-栈区间最大值

 

 

package com.andong.demo.stack.区间最大值;

import java.util.Stack;

/**
 * @Author andong
 * @Description: 
 * 数组：区间和
 * 栈：下标 大的话 出栈
 */
public class ByteDanceEx1 {
    public static void main(String[] args) {
        int[] numbers = {5,2,3,4,1};
        System.out.println(new ByteDanceEx1().getMax(numbers));
    }


    public int getMax(int[] numbers) {
        if (numbers == null || numbers.length == 0) {
            return 0;
        }
        Stack<Integer> stack = new Stack<Integer>();
        int max = 0;
        //求前缀和数组
        int[] sum = new int[numbers.length + 1];
        for (int i = 1; i <= numbers.length; i++) {
            sum[i] = sum[i - 1] + numbers[i - 1];
        }
        for(int i = 0; i < numbers.length; i++) {
            while (!stack.isEmpty() && numbers[i] < numbers[stack.peek()]) {
                int index = stack.pop();
                int left = i;
                int right = i;
                if (stack.isEmpty()) {
                    left = 0;
                } else {
                    left = index;
                }
                //用 O（1）取到前缀和
                max = Math.max(max, numbers[index] * (sum[right] - sum[left]));
            }
            stack.push(i);
        }
        while (!stack.isEmpty()) {
            int index = stack.pop();
            int left = numbers.length;
            int right = numbers.length;
            if (stack.isEmpty()) {
                left = 0;
            } else {
                left = index;
            }
            max = Math.max(max, numbers[index] * (sum[right] - sum[left]));
        }
        return max;
    }
}