题目描述
给定一个整形数组,找出最大下标距离j−i, 当且A[i] < A[j] 和 i < j
解法
复杂度:三次扫描,每次的复杂度O(N)
算法:{5,3,4,0,1,4,1}
找出从第一个元素开始的下降序列{5,3,0}
i=3,j=6, j从尾部扫描
初始化,i=3, j=6, A[i]=0
public static int maxindexdistance(int A[]) {
boolean[] isDes = new boolean[A.length];
int min = A[0];
isDes[0] = true;
for (int i = 0; i < A.length; i++) {
if (A[i] < min) {
isDes[i] = true;
min = A[i];
}
}
int maxdis = 0;
int i = A.length - 1;
int j = A.length - 1;
System.out.println(Arrays.toString(isDes));
while (i >= 0) {
while (isDes[i] == false) {
i--;
}
while (j > i && A[j] <= A[i]) {
j--;
}
if ((j - i) > maxdis) {
maxdis = j - i;
}
i--;
}
return maxdis;
}