暴力解法:遍历出所有利润,保存到一个数组当中,再对数组进行排序,返回数组最大值,此方法理论可行,但是实际操作中会出现虚拟内存不足的报错,仅供学习
/**
* @param {number[]} prices
* @return {number}
*/
var maxProfit = function(prices) {
let backs=[]
if(prices.length<=1){
return 0
}
for(let i=0;i<=prices.length-2;i++){
for(let j=i+1;j<prices.length;j++){
if(prices[j]<=prices[i]){
continue
}
backs.push(prices[j]-prices[i])
}
}
if(backs.length===0){
return 0
}
backs.sort((a,b)=>{
return a-b
})
return backs[backs.length-1]
};