Description
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.
Note:
- 2 <= A.length <= 50000
- 0 <= A[i] <= 50000
分析
题目的意思是:给定一个数组,找出最长的ramp的宽度,ramp的宽度定义为i<j, A[i]<=A[j],这道题我能够想到的是暴力破解,发现ac不了。看了答案才发现数组的值排序的时候记录值所在的位置,然后遍历位置找出与最小值所在的位置的最大间隔就行了。这里有个排序挺奇怪的,我把一个例子输入进去,发现是对下标进行排序,例子如下:
>>> A=[6,0,8,2,1,5]
>>> a=sorted(range(len(A)),key=A.__getitem__)
>>> a
[1, 4, 3, 5, 0, 2]
代码
class Solution:
def maxWidthRamp(self, A: List[int]) -> int:
n=len(A)
m=float('inf')
res=0
for i in sorted(range(n),key=A.__getitem__):
res=max(res,i-m)
m=min(m,i)
return res