weixin_44013557的博客

215. 数组中的第K个最大元素class Solution { public void swap(int[] a, int i, int j) { int tmp = a[i]; a[i] = a[j]; a[j] = tmp; } public void buildMaxHeap(int[] a, int i, int length) { int l = (i << 1) + 1; in

LeetCode刷题记156407. 接雨水 II题目class Solution { public int trapRainWater(int[][] heightMap) { class MyComparator implements Comparator<Pair<Integer, Integer>> { @Override public int compare(Pair<Integer,

LeetCode刷题记155239. 滑动窗口最大值题目class Solution { public int[] maxSlidingWindow(int[] nums, int k) { PriorityQueue<Integer> pq = new PriorityQueue<Integer>((a, b) -> b - a); // 存值，大的在前面 int[] cnt = new int[20005]; // 存值

LeetCode刷题记15484. 柱状图中最大的矩形题目class Solution { public int largestRectangleArea(int[] heights) { if (heights.length == 0) return 0; int[] sta = new int[heights.length]; //模拟栈，记录下标，这里存的高度是严格递增的 int top = -1; int ans =