单调栈结构

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public class Mon {
  public static int[][] getNearLessNoRepeat(int[] arr) {
    int[][] result = new int[arr.length][2];
    Stack<Integer> stack = new Stack<Integer>();
    for (int i = 0; i < arr.length; i++) {
      while (!stack.isEmpty() && arr[stack.peek()] > arr[i]) {
        int popIndex = stack.pop();
        int leftLessIndex = stack.isEmpty() ? -1 : stack.peek();
        result[popIndex][0] = leftLessIndex;
        result[popIndex][1] = i;
      }
      stack.push(i);
    }
    while (!stack.isEmpty()) {
      int popIndex = stack.pop();
      int leftLessIndex = stack.isEmpty() ? -1 : stack.peek();
      result[popIndex][0] = leftLessIndex;
      result[popIndex][1] = -1;
    }
    return result;
  }

  public static int[][] getNearLess(int[] arr) {
      int[][] res = new int[arr.length][2];
      Stack<List<Integer>> stack = new Stack<List<Integer>>();
      for (int i = 0; i < arr.length; i++) {
          while (!stack.isEmpty() && arr[stack.peek().get(0)] > arr[i]) {
              List<Integer> popIS = stack.pop();
              int leftLessIndex = stack.isEmpty() ? -1 : stack.peek().get(stack.peek().size() - 1);
              for (Integer popi : popIS) {
                  res[popi][0] = leftLessIndex;
                  res[popi][1] = i;
              }
          }
          if (!stack.isEmpty() && arr[stack.peek().get(0)] == arr[i]) {
              stack.peek().add(Integer.valueOf(i));

          } else {
              ArrayList<Integer> list = new ArrayList<Integer>();
              list.add(i);
              stack.push(list);
          }
          while (!stack.isEmpty()) {
              List<Integer> popIs = stack.pop();
              int leftLessIndex = stack.isEmpty()
                      ? -1
                      : stack.peek().get(stack.peek().get(stack.peek().size() - 1));
              for (Integer popi : popIs) {
                  res[popi][0] = leftLessIndex;
                  res[popi][1] = -1;
              }
          }
      }
      return res;
  }

  
}