Approach 1: Heap
- Time:O(n\log n)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Sort
- Time:O(n\log n)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|