weixin_38199770的博客

//解法一：分治最快class Solution { public int[] getLeastNumbers(int[] arr, int k) { if(k == 0 || arr.length == 0) return new int[0]; return quickSearch(arr, 0, arr.length - 1, k - 1); } private int[] quickSearch(int[] nums.

官方题解//解法一：优先队列（最小堆）class Ugly { public int[] nums = new int[1690]; Ugly() { HashSet<Long> seen = new HashSet(); PriorityQueue<Long> heap = new PriorityQueue<Long>(); seen.add(1L); heap.add(1L); long currUgly, n.

题解class Solution { public int[] maxSlidingWindow(int[] nums, int k) { if(nums == null || nums.length<k || k<1){ return new int[0]; } //#1 LinkedList<Integer> queue = new LinkedList<>(); .

大佬题解//解法一：优先队列（PriorityQueue）class Solution { public List<List<Integer>> getSkyline(int[][] buildings) { List<List<Integer>> points = new ArrayList<>(); List<List<Integer>> results = new Arr..

大佬题解//解法一：长度为len的小顶堆，前k个直接插入，后面的元素依次和堆顶比较是否出插入，如果插入就把堆顶先拿掉class Solution { public int findKthLargest(int[] nums, int k) { PriorityQueue<Integer> q = new PriorityQueue<Integer>(k,(a, b)->a - b); for(int i = 0;i < k; .

官方题解解法一：优先队列（无空间优化）/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; thi.

官方题解class Solution { public double[] medianSlidingWindow(int[] nums, int k) { DualHeap dh = new DualHeap(k); for (int i = 0; i < k; ++i) { dh.insert(nums[i]); } double[] ans = new double[nums.length - k .

题解class MedianFinder { private PriorityQueue<Integer> small; private PriorityQueue<Integer> large; /** initialize your data structure here. */ public MedianFinder() { //small的堆顶要小于large的堆顶 // 小顶堆 large = n.