Approach 1: Gready
- Time:O(n)
- Space:O(1)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Divide and Conquer
- Time:O(n\log n)
- Space:O(\log n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 3: DP
- Time:O(n)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|