sort
Vendredimatin
这个作者很懒,什么都没留下…
展开
-
Leetcode sort Top interview Question 6道题总结
本文针对Leetcode下sort标签的6道Top interview Question进行总结 Leetcode 75. sort colors 使用快排算法思想,以1作为pivot,然后不断交换0和1 Leetcode 148. Sort List 对链表进行排序,使用归并排序能够达到O(nlogn) Leetcode 315. Count of Smaller Numbers After Self 本题即为求逆序数对,求逆序相关的问题,归并排序是标准思路,归并排序的过程中,可以顺便把逆序数求出来,因为原创 2020-07-06 10:23:01 · 184 阅读 · 0 评论 -
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 = 2 Output: 5 Example 2: Input: [3,2,3,1,2,4,5,5,6] and k = 4 Output: 4 meth原创 2020-06-29 17:28:06 · 98 阅读 · 0 评论 -
Leetcode 179. Largest Number
Given a list of non negative integers, arrange them such that they form the largest number. Example 1: Input: [10,2] Output: “210” Example 2: Input: [3,30,34,5,9] Output: “9534330” Note: The result may be very large, so you need to return a string instead原创 2020-06-29 17:25:16 · 140 阅读 · 0 评论 -
Leetcode 324. Wiggle Sort II
Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]… Example 1: Input: nums = [1, 5, 1, 1, 6, 4] Output: One possible answer is [1, 4, 1, 5, 1, 6]. Example 2: Input: nums = [1, 3, 2, 2, 3, 1] Output: One possib原创 2020-06-29 17:21:30 · 130 阅读 · 0 评论 -
Leetcode 315. Count of Smaller Numbers After Self
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i]. Example: Input: [5,2,6,1] Output: [2,1,1,0] Explanation: To the righ原创 2020-06-29 16:42:46 · 117 阅读 · 0 评论 -
Leetcode 148. Sort List
Sort a linked list in O(n log n) time using constant space complexity. Example 1: Input: 4->2->1->3 Output: 1->2->3->4 Example 2: Input: -1->5->3->4->0 Output: -1->0->3->4->5 method 1 归并排序 先使用快慢指针,将链表一分为二,然后使用归并排序。原创 2020-06-29 15:58:57 · 111 阅读 · 0 评论 -
leetcode 75. Sort Colors
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the int...原创 2019-06-12 11:33:42 · 107 阅读 · 0 评论 -
Leetcode 56. Merge Intervals
Given 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, m...原创 2019-06-18 10:45:00 · 121 阅读 · 0 评论