# 1340. Jump Game V

Given an array of integers arr and an integer d. In one step you can jump from index i to index:

• i + x where: i + x < arr.length and 0 < x <= d.
• i - x where: i - x >= 0 and 0 < x <= d.

In addition, you can only jump from index i to index j if arr[i] > arr[j] and arr[i] > arr[k] for all indices k between i and j (More formally min(i, j) < k < max(i, j)).

You can choose any index of the array and start jumping. Return the maximum number of indices you can visit.

Notice that you can not jump outside of the array at any time.

Example 1:

Input: arr = [6,4,14,6,8,13,9,7,10,6,12], d = 2
Output: 4
Explanation: You can start at index 10. You can jump 10 –> 8 –> 6 –> 7 as shown.
Note that if you start at index 6 you can only jump to index 7. You cannot jump to index 5 because 13 > 9. You cannot jump to index 4 because index 5 is between index 4 and 6 and 13 > 9.
Similarly You cannot jump from index 3 to index 2 or index 1.

Example 2:

Input: arr = [3,3,3,3,3], d = 3
Output: 1
Explanation: You can start at any index. You always cannot jump to any index.

Example 3:

Input: arr = [7,6,5,4,3,2,1], d = 1
Output: 7
Explanation: Start at index 0. You can visit all the indicies.

Constraints:

• 1 <= arr.length <= 1000
• 1 <= arr[i] <= 105
• 1 <= d <= arr.length

class Solution {
public:
int maxJumps(vector<int>& arr, int d) {
int res = 1, n = arr.size();
vector<int> memo(1001);
for (int i = 0; i < n; ++i) {
res = max(res, dfs(arr, d, i, memo));
}
return res;
}
int dfs(vector<int>& arr, int d, int i, vector<int>& memo) {
if (memo[i]) return memo[i];
int res = 1, n = arr.size();
for (int j = i + 1; j <= min(i + d, n - 1) && arr[j] < arr[i]; ++j) {
res = max(res, 1 + dfs(arr, d, j, memo));
}
for (int j = i - 1; j >= max(0, i - d) && arr[j] < arr[i]; --j) {
res = max(res, 1 + dfs(arr, d, j, memo));
}
return memo[i] = res;
}
};

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1340

Jump Game

Jump Game II

Jump Game III

Jump Game IV

Jump Game VI

Jump Game VII

Jump Game VIII

https://leetcode.com/problems/jump-game-v/

https://leetcode.com/problems/jump-game-v/solutions/496520/top-down-dp-o-nd/

https://leetcode.com/problems/jump-game-v/solutions/496719/c-top-down-dp-memoization/

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation