Approach 1: Top-down
- Time:O(n \cdot \texttt{maxJump})
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Bottom-up
- Time:O(n \cdot \texttt{maxJump})
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|