LeeCode_sorting and searching
Haskei
这个作者很懒,什么都没留下…
展开
-
[LeeCode] 973. K Closest Points to Origin (Python) 最小堆/ 快排
973.K Closest Points to OriginMediumWe have a list ofpointson the plane. Find theKclosest points to the origin(0, 0).(Here, the distance between two points on a plane is the Euclidean distance.)You may return the answer in any order. Thean...原创 2020-06-15 00:57:07 · 207 阅读 · 0 评论 -
[LeeCode] 347. Top K Frequent Elements (Python) 最小堆/ 桶排序
347.Top K Frequent ElementsMediumGiven a non-empty array of integers, return thekmost frequent elements.Example 1:Input: nums = [1,1,1,2,2,3], k = 2Output: [1,2]Example 2:Input: nums = [1], k = 1Output: [1]Note:You may assumekis ...原创 2020-06-15 00:28:05 · 382 阅读 · 0 评论 -
[LeeCode] 253. Meeting Rooms II (Python) 最小堆
253.Meeting Rooms IIMediumGiven an array of meeting time intervals consisting of start and end times[[s1,e1],[s2,e2],...](si< ei), find the minimum number of conference rooms required.Example 1:Input: [[0, 30],[5, 10],[15, 20]]Output: 2E...原创 2020-06-14 21:48:35 · 178 阅读 · 0 评论 -
[LeeCode] 215. Kth Largest Element in an Array (Python)
215.Kth Largest Element in an ArrayMediumFind thekth 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:..原创 2020-06-14 11:55:25 · 153 阅读 · 0 评论 -
[LeeCode] 167. Two Sum II - Input array is sorted (Python)
167.Two Sum II - Input array is sortedEasyGiven an array of integers that is alreadysorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that..原创 2020-06-14 07:47:35 · 173 阅读 · 0 评论 -
[LeeCode] 56. Merge Intervals (Python)
56.Merge IntervalsMediumGiven a collection of intervals, merge all overlapping intervals.Example 1:Input: [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6]..原创 2020-06-14 00:06:25 · 227 阅读 · 0 评论 -
[LeeCode] 33. Search in Rotated Sorted Array (Python)
33.Search in Rotated Sorted ArrayMediumSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e.,[0,1,2,4,5,6,7]might become[4,5,6,7,0,1,2]).You are given a target value to search. If found in the array...原创 2020-06-13 23:02:57 · 213 阅读 · 0 评论 -
[LeeCode] 4. Median of Two Sorted Arrays (Python)
4.Median of Two Sorted ArraysHardThere are two sorted arraysnums1andnums2of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assumenums1andnums2cannot be bot...原创 2020-06-13 09:26:41 · 164 阅读 · 0 评论