优先队列
Vendredimatin
这个作者很懒,什么都没留下…
展开
-
Leetcode 215. Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Example 1:Input: [3,2,1,5,6,4] and k = 2Output: 5Example 2:Input: [3,2,3,1,2,4,5,5,6] and k = 4Output: 4meth原创 2020-06-29 17:28:06 · 100 阅读 · 0 评论 -
Leetcode 378. Kth Smallest Element in a Sorted Matrix
Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.Note that it is the kth smallest element in the sorted order, not the kth distinct element.Example:matrix = [[ 1, 5, 9]原创 2020-06-29 10:46:52 · 119 阅读 · 0 评论 -
Lintcode 791. Merge Number
给出n个数,现在要将这n个数合并成一个数,每次只能选择两个数a,b合并,每次合并需要消耗a+b的能量,输出将这n个数合并成一个数后消耗的最小能量。public int mergeNumber(int[] numbers) { // Write your code here PriorityQueue<Integer> priorityQueue = new Pri...原创 2018-10-07 11:33:25 · 273 阅读 · 0 评论