//复杂度为O(n^2)的解法,遍历数组中的每一个后面所有元素,找到第一个大于它的的元素的索引保存在数组中返回即可
//O(N)解法 借助单调栈
function findLargestIndex(arr){
let result = []
let stack = [0]
let length = arr.length
let index = 1
while(index < length){
if(stack.length && arr[index] > arr[stack[stack.length-1]]){
result[stack.pop()] = index
}else{
stack.push(index)
index++
}
}
while(stack.length){
result[stack.pop()] = -1
}
return result
}
console.log(findLargestIndex([1,3,2,5,4,11,7,10]))//1,3,3,5,5,-1,7,-1