g1301_1400.s1340_jump_game_v.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1301_1400.s1340_jump_game_v;
// #Hard #Array #Dynamic_Programming #Sorting #2022_03_19_Time_13_ms_(71.33%)_Space_47.7_MB_(46.67%)
public class Solution {
public int maxJumps(int[] arr, int d) {
int n = arr.length;
int[] dp = new int[n];
int jumps = 0;
for (int i = 0; i < n; i++) {
jumps = Math.max(jumps, helper(arr, d, i, dp));
}
return jumps;
}
private int helper(int[] arr, int d, int i, int[] dp) {
int temp = 0;
if (dp[i] != 0) {
return dp[i];
}
int l = Math.max(0, i - d);
int r = Math.min(i + d, arr.length - 1);
for (int j = i - 1; j >= l && arr[i] > arr[j]; j--) {
temp = Math.max(temp, helper(arr, d, j, dp));
}
for (int j = i + 1; j <= r && arr[i] > arr[j]; j++) {
temp = Math.max(temp, helper(arr, d, j, dp));
}
return 1 + temp;
}
}