divide and conquer
文章平均质量分 79
Yingying_code
这个作者很懒,什么都没留下…
展开
-
215. Kth Largest Element in an Array**
public int findKthLargest(int[] nums, int k) { PriorityQueue pq = new PriorityQueue(); for(int i=0;i<nums.length;i++){ pq.offer(nums[i]); }原创 2017-01-12 00:34:38 · 195 阅读 · 0 评论 -
240. Search a 2D Matrix II**
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted in ascending from left to right.Integers in原创 2017-01-31 14:27:46 · 245 阅读 · 0 评论