weixin_44013557的博客

1047. 删除字符串中的所有相邻重复项class Solution { public String removeDuplicates(String S) { int[] sta = new int[S.length()]; int id = 0; for (int i = 0; i < S.length(); i ++) { boolean f = false; while (id != 0)

LeetCode刷题记14385. 最大矩形题目class Solution { public int maximalRectangle(char[][] matrix) { if (matrix.length == 0 || matrix[0].length == 0) return 0; int[] heights = new int[matrix[0].length]; int ans = 0; for (int i =

LeetCode刷题记14284. 柱状图中最大的矩形题目class Solution { public int largestRectangleArea(int[] heights) { int[][] ind = new int[heights.length][2]; Stack<Integer> sta = new Stack<Integer>(); for (int i = 0; i < heights.

LeetCode刷题记153975. 奇偶跳题目class Solution { public int oddEvenJumps(int[] A) { if (A.length == 0) return 0; // 记录每个数值出现在哪些下标中 List<Integer>[] ind = new ArrayList[100005]; // 记录下标 for (int i = 0; i < A.length; i

LeetCode刷题记152224. 基本计算器题目class Solution { public int calculate(String s) { s = s.replaceAll(" ", ""); if (s.length() == 0) return 0; Stack<Character> sta = new Stack<Character>(); for (int i = 0; i <

LeetCode刷题记151面试题 17.21. 直方图的水量题目class Solution { public int trap(int[] height) { // Stack<Integer> ind = new Stack<Integer>(); int top = -1; int[] sta = new int[height.length]; int ans = 0; for (