g0901_1000.s0962_maximum_width_ramp.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0901_1000.s0962_maximum_width_ramp;
// #Medium #Array #Stack #Monotonic_Stack #2022_03_31_Time_6_ms_(90.69%)_Space_57.6_MB_(36.44%)
public class Solution {
public int maxWidthRamp(int[] nums) {
int m = nums.length;
int[] dp = new int[m];
int minInd = 0;
int ramp = 0;
for (int i = 0; i < m; i++) {
int prInd = minInd;
while (prInd > 0 && nums[i] >= nums[dp[prInd]]) {
prInd = dp[prInd];
}
dp[i] = prInd;
if (nums[i] >= nums[prInd]) {
ramp = Math.max(ramp, i - prInd);
}
minInd = nums[i] < nums[minInd] ? i : minInd;
}
return ramp;
}
}