leetcode962 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[1] = 0 and A[5] = 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[2] = 1 and A[9] = 1.

求解

public int maxWidthRamp(int[] A) {
	int N=A.length;
	int[] B=new int[N];
	for(int i=0;i<N;i++){
		B[i]=i;//建立索引
	}
	Arrays.sort(B,(i,j)->((Integer)A[i].compareTo(A[j]);//B的坐标值为其排列顺序
	int m=N,ans=0;//m为之前遇到的最小索引
	for(int i: B){
		ans=Math.max(ans,i-m); //step1
		m=Math.min(m,i);//step2
	}
}