Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].
Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where:

0 <= j <= nums[i] and
i + j < n

Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].
 
Please complete the following python code precisely:
```python
class Solution:
    def jump(self, nums: List[int]) -> int:
```