Last Updated: 26-Jan-2021 Home >> LeetCode >> Maximum Width Ramp In this post, we will learn how to solve LeetCode's Maximum Width Ramp Problem and will implement its solution in Java. Maximum Width Ramp Problem Given an array A of integers, a ramp is a tuple (i, j) for which i < j and A[i] <= A[j]. The width of such a ramp is j - i. Find the maximum width of a ramp in A. If one doesn't exist, return 0. Example 1: Input: [6,0,8,2,1,5] Output: 4 Explanation: The maximum width ramp is achieved at (i, j) = (1, 5): A[1] = 0 and A[5] = 5. Example 2: Input: [9,8,1,0,1,9,4,0,4,1] Output: 7 Explanation: The maximum width ramp is achieved at (i, j) = (2, 9): A[2] = 1 and A[9] = 1. Practice this problem on LeetCode(Click Here). Maximum Width Ramp Java Solution Approach 1 Brute Force Solution. Note: This might give you a time limit error. Java Program: class Solution { public int maxWidthRamp ( int [] A ) { int max_width = 0 ;
Comments
Post a Comment