Given an array of integers nums
, sort the array in ascending order.
Example 1:
Input: nums = [5,2,3,1]
Output: [1,2,3,5]
Example 2:
Input: nums = [5,1,1,2,0,0]
Output: [0,0,1,1,2,5]
Constraints:
-
1 <= nums.length <= 5 * 104
-
-5 * 104 <= nums[i] <= 5 * 104
SOLUTION:
import heapq
class Solution:
def sortArray(self, nums: List[int]) -> List[int]:
n = len(nums)
heapq.heapify(nums)
return heapq.nsmallest(n, nums)
Top comments (0)