Maximum Width Ramp
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.
Input: [6,0,8,2,1,5] Output: 4 Explanation: The maximum width ramp is achieved at (i, j) = (1, 5): A = 0 and A = 5.
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 = 1 and A = 1.
- 2 <= A.length <= 50000
- 0 <= A[i] <= 50000
Credits To: leetcode.com
Leave me comments, if you have better ways to solve.
- Solution: XXX
Walk Through Testdata
// Blog link: https://code.dennyzhang.com/maximum-width-ramp